| Task: | Split in Three |
| Sender: | Kesatria_Komodo |
| Submission time: | 2021-07-02 16:02:53 +0300 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | 22 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 22 |
| #2 | WRONG ANSWER | 0 |
| 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 | WRONG ANSWER | 0.01 s | 2 | details |
| #10 | WRONG ANSWER | 0.01 s | 2 | details |
| #11 | WRONG ANSWER | 0.01 s | 2 | details |
| #12 | ACCEPTED | 0.01 s | 2 | details |
| #13 | WRONG ANSWER | 0.01 s | 2 | details |
| #14 | WRONG ANSWER | 0.01 s | 2 | details |
| #15 | ACCEPTED | 0.01 s | 2 | details |
Code
#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <fstream>
#include <bitset>
#include <cassert>
#include <cstring>
#include <ctime>
#include <cmath>
#include <set>
#include <map>
#include <algorithm>
#define sec second
#define fir first
#define deb(...) deb_print(#__VA_ARGS__ , __VA_ARGS__);
using namespace std;
template <typename ...Args>
void deb_print(string s , Args&& ...arg){
static const string limiter = "\n";
cerr << s << " : ";
cerr << (... , (cout << arg << ' ' , limiter));
}
using vi = vector<int>;
using vii = vector<vi>;
using pii = pair<int , int>;
using ll = long long;
using ld = long double;
const int MAX = 1e9 , MIN = - MAX , MOD = 1e9 + 7;
const ll MAX_LL = 1e18 , MIN_LL = -MAX_LL;
int main(){
int N;
cin >> N;
if (N * (N + 1) % 3)
return 0 * puts("IMPOSSIBLE");
if (N == 3)
return 0 * puts("1 2 3");
int kel[N + 1];
fill(kel , kel + N + 1 , 3);
if (N % 3 == 0){
kel[N - 1] = kel[2] = 2;
kel[N] = 1;
if (N % 6){
kel[N / 2 + 1] = 2;
kel[N / 2] = kel[1] = 1;
}
for (int i = 0 ; i < (N / 6 - 1) * 2 ; ++i)
kel[i + 3] = kel[N - i - 2] = (i ? 1 : 2);
}
else{
kel[N] = 2;
kel[N - 1] = 1;
if ((N + 1) % 6){
kel[N / 2] = 2;
kel[1] = kel[N / 2 - 1] = 1;
}
for (int i = 0 ; i < ((N + 1) / 6 - 1) * 2 ; ++i)
kel[i + 2] = kel[N - i - 2] = (i ? 1 : 2);
}
for (int i = 1 ; i <= N ; ++i)
cout << kel[i] << (i == N ? '\n' : ' ');
}
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 |
|---|
| 1 3 1 2 3 3 1 2 |
Test 7
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 9 |
| correct output |
|---|
| 1 2 3 1 2 3 3 2 1 |
| user output |
|---|
| 1 2 3 1 2 3 3 2 1 |
Test 8
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 10 |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| IMPOSSIBLE |
Test 9
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 42 |
| correct output |
|---|
| 1 3 2 2 1 3 1 2 3 3 2 1 1 2 3 ... |
| user output |
|---|
| 3 2 2 1 1 1 1 1 1 1 1 1 1 1 3 ... |
Test 10
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 95 |
| correct output |
|---|
| 1 3 1 3 2 1 2 3 3 2 1 1 2 3 3 ... |
| user output |
|---|
| 3 2 1 1 1 1 1 1 1 1 1 1 1 1 1 ... Truncated |
Test 11
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 96 |
| correct output |
|---|
| 1 3 2 2 1 3 1 2 3 3 2 1 1 2 3 ... |
| user output |
|---|
| 3 2 2 1 1 1 1 1 1 1 1 1 1 1 1 ... Truncated |
Test 12
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 97 |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| IMPOSSIBLE |
Test 13
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 98 |
| correct output |
|---|
| 2 3 1 2 3 3 2 1 1 2 3 3 2 1 1 ... |
| user output |
|---|
| 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 ... Truncated |
Test 14
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 99 |
| correct output |
|---|
| 1 2 3 1 2 3 3 2 1 1 2 3 3 2 1 ... |
| user output |
|---|
| 1 2 2 1 1 1 1 1 1 1 1 1 1 1 1 ... Truncated |
Test 15
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| IMPOSSIBLE |