Task: | Split in Three |
Sender: | f1x9d |
Submission time: | 2021-01-30 13:29:44 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 22 |
#2 | ACCEPTED | 78 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1, 2 | details |
#2 | ACCEPTED | 0.01 s | 1, 2 | details |
#3 | ACCEPTED | 0.01 s | 1, 2 | details |
#4 | ACCEPTED | 0.01 s | 1, 2 | details |
#5 | ACCEPTED | 0.01 s | 1, 2 | details |
#6 | ACCEPTED | 0.01 s | 1, 2 | details |
#7 | ACCEPTED | 0.01 s | 1, 2 | details |
#8 | ACCEPTED | 0.01 s | 1, 2 | details |
#9 | ACCEPTED | 0.01 s | 2 | details |
#10 | ACCEPTED | 0.01 s | 2 | details |
#11 | ACCEPTED | 0.01 s | 2 | details |
#12 | ACCEPTED | 0.01 s | 2 | details |
#13 | ACCEPTED | 0.01 s | 2 | details |
#14 | ACCEPTED | 0.01 s | 2 | details |
#15 | ACCEPTED | 0.01 s | 2 | details |
Compiler report
input/code.cpp:64:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type] main () { ^
Code
#include <bits/stdc++.h> //#pragma GCC optimize "O3" ///if ((double) ((double)(clock() - cl)/(double)CLOCKS_PER_SEC)>1.85) { break;} #include <ext/pb_ds/assoc_container.hpp> #define int long long #define double long double #define ft first #define sc second #define pb push_back #define e '\n' #define booost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cerr.tie(0); #define all(x) (x).begin(),(x).end() #define file(x) freopen(string(string((x)) + ".in").c_str(), "r", stdin); freopen(string(string((x)) + ".out").c_str(), "w", stdout); #define GG cout << " OPA " << '\n'; using namespace std; using namespace __gnu_pbds; typedef pair <int, int> pi; typedef tree <pi, null_type, less<pi>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); const int N = 20 + 5; const int K = 10; const int KK = 20; const int INF = 1e18; const double d_INF = 2000000000.0; const double EPS = 1e-17; const int MOD = 1e9 + 7; const int LOG = 30; void solve() { int n; cin >> n; int sum = (n + 1) * n / 2; if (sum % 3 != 0) {cout << "IMPOSSIBLE\n"; return;} sum /= 3; sum --; set <int> m; for (int i = 1; i <= n; i ++) { m.insert(i); } map <int, int> mp; map <int, int> used; int need = sum; for (int i = n; i >= 1; i --) { if (used[i] || i > need) continue; mp[i] = 1; used[i] = 1; need -= i; } need = sum + 1; for (int i = n; i >= 1; i --) { if (used[i] || i > need) continue; mp[i] = 2; used[i] = 1; need -= i; } for (int i = 1; i <= n; i ++) { if (!mp[i]) cout << 3 << ' '; else cout << mp[i] << ' '; } } main () { int test = 1; booost; // cin >> test; while (test --) { solve(); } }
Test details
Test 1
Group: 1, 2
Verdict: ACCEPTED
input |
---|
3 |
correct output |
---|
1 2 3 |
user output |
---|
1 2 3 |
Test 2
Group: 1, 2
Verdict: ACCEPTED
input |
---|
4 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 3
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 |
correct output |
---|
1 3 1 3 2 |
user output |
---|
3 3 3 1 2 |
Test 4
Group: 1, 2
Verdict: ACCEPTED
input |
---|
6 |
correct output |
---|
1 3 2 2 1 3 |
user output |
---|
3 2 3 3 2 1 |
Test 5
Group: 1, 2
Verdict: ACCEPTED
input |
---|
7 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 6
Group: 1, 2
Verdict: ACCEPTED
input |
---|
8 |
correct output |
---|
2 3 1 2 3 3 2 1 |
user output |
---|
3 3 1 3 2 3 2 1 |
Test 7
Group: 1, 2
Verdict: ACCEPTED
input |
---|
9 |
correct output |
---|
1 2 3 1 2 3 3 2 1 |
user output |
---|
3 3 3 3 1 3 2 2 1 |
Test 8
Group: 1, 2
Verdict: ACCEPTED
input |
---|
10 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 9
Group: 2
Verdict: ACCEPTED
input |
---|
42 |
correct output |
---|
1 3 2 2 1 3 1 2 3 3 2 1 1 2 3 ... |
user output |
---|
3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ... |
Test 10
Group: 2
Verdict: ACCEPTED
input |
---|
95 |
correct output |
---|
1 3 1 3 2 1 2 3 3 2 1 1 2 3 3 ... |
user output |
---|
3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ... Truncated |
Test 11
Group: 2
Verdict: ACCEPTED
input |
---|
96 |
correct output |
---|
1 3 2 2 1 3 1 2 3 3 2 1 1 2 3 ... |
user output |
---|
3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ... Truncated |
Test 12
Group: 2
Verdict: ACCEPTED
input |
---|
97 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 13
Group: 2
Verdict: ACCEPTED
input |
---|
98 |
correct output |
---|
2 3 1 2 3 3 2 1 1 2 3 3 2 1 1 ... |
user output |
---|
3 3 3 3 1 3 3 3 3 3 3 3 3 3 3 ... Truncated |
Test 14
Group: 2
Verdict: ACCEPTED
input |
---|
99 |
correct output |
---|
1 2 3 1 2 3 3 2 1 1 2 3 3 2 1 ... |
user output |
---|
3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ... Truncated |
Test 15
Group: 2
Verdict: ACCEPTED
input |
---|
100 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |