Contest Duration: - (local time) (120 minutes) Back to Home

Submission #8360544

Source Code Expand

Copy
```// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

int main(int argc, char const* argv[])
{
int n; cin >> n;
ll k; cin >> k;
if(k > n){
cout << -1 << endl;
return 0;
}
vector<pair<P, int>> res(n);

set<ll> st1, st2;
rep(i, n){
st1.insert(i);
st2.insert(i);
}

rep(i, n){
int min1 = *(st1.begin());
ll jb = n - k - min1;
auto itr = st2.upper_bound(jb);
if(itr != st2.begin()){
itr--;
ll rem = n - k - *itr;
auto litr = st1.upper_bound(rem);
litr--;
res[i] = mk(mk(k + *litr, k + n + *itr), k + 2 * n + i);
st2.erase(itr);
st1.erase(litr);
}else{
cout << -1 << endl;
return 0;
}
}

rep(i, n){
assert(res[i].first.first + res[i].first.second <= res[i].second);
}

rep(i, n){
cout << res[i].first.first << " " << res[i].first.second << " " << res[i].second << endl;
}
return 0;
}
```

#### Submission Info

Submission Time 2019-11-09 22:03:23+0900 E - Non-triangular Triplets fumiphys C++14 (GCC 5.4.1) 0 3818 Byte WA 65 ms 10752 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
 AC × 2
 AC × 12 WA × 26
Set Name Test Cases
Sample sample01.txt, sample02.txt
All sample01.txt, sample02.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, sample01.txt, sample02.txt
Case Name Status Exec Time Memory
in01.txt WA 61 ms 10240 KB
in02.txt WA 65 ms 10624 KB
in03.txt WA 57 ms 10496 KB
in04.txt WA 63 ms 10624 KB
in05.txt WA 54 ms 9984 KB
in06.txt WA 54 ms 9728 KB
in07.txt WA 56 ms 10368 KB
in08.txt WA 60 ms 10112 KB
in09.txt WA 58 ms 9856 KB
in10.txt WA 62 ms 10752 KB
in11.txt WA 53 ms 9728 KB
in12.txt WA 54 ms 9856 KB
in13.txt WA 63 ms 10752 KB
in14.txt WA 49 ms 9600 KB
in15.txt WA 51 ms 9728 KB
in16.txt WA 56 ms 10368 KB
in17.txt WA 54 ms 10496 KB
in18.txt WA 44 ms 8704 KB
in19.txt WA 48 ms 9600 KB
in20.txt WA 55 ms 10624 KB
in21.txt AC 54 ms 10496 KB
in22.txt AC 42 ms 8832 KB
in23.txt WA 60 ms 10496 KB
in24.txt AC 1 ms 256 KB
in25.txt WA 28 ms 6144 KB
in26.txt WA 24 ms 5504 KB
in27.txt WA 12 ms 2944 KB
in28.txt WA 17 ms 4352 KB
in29.txt AC 1 ms 256 KB
in30.txt AC 61 ms 10752 KB
in31.txt WA 58 ms 10752 KB
in32.txt AC 60 ms 10752 KB
in33.txt AC 1 ms 256 KB
in34.txt AC 1 ms 256 KB
sample01.txt AC 1 ms 256 KB
sample02.txt AC 1 ms 256 KB