CSES - Datatähti Open 2021 - Results
Submission details
Task:Split in Three
Sender:_martynas
Submission time:2021-01-30 18:16:28 +0200
Language:C++ (C++11)
Status:READY
Result:22
Feedback
groupverdictscore
#1ACCEPTED22
#20
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2details
#2ACCEPTED0.01 s1, 2details
#3ACCEPTED0.01 s1, 2details
#4ACCEPTED0.01 s1, 2details
#5ACCEPTED0.01 s1, 2details
#6ACCEPTED0.01 s1, 2details
#7ACCEPTED0.01 s1, 2details
#8ACCEPTED0.01 s1, 2details
#9ACCEPTED0.01 s2details
#10--2details
#11ACCEPTED0.60 s2details
#12ACCEPTED0.01 s2details
#13--2details
#14--2details
#15ACCEPTED0.01 s2details

Compiler report

input/code.cpp: In function 'void solve()':
input/code.cpp:59:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~

Code

#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100;
int t;
int n;
int Group[MAX_N];
int Sum[3] = { 0 };
bool found = false;
bool check()
{
if(Sum[1] - Sum[0] == 1 && Sum[2] - Sum[1] == 1)
return true;
else
return false;
}
void recur(int pos)
{
if(pos == n)
{
if(check())
{
found = true;
for(int i = 0; i < n; i++)
{
cout << Group[i] << " ";
}
cout << endl;
}
return;
}
if(Sum[0] > n*(n+1)/3 || Sum[1] > n*(n+1)/3 || Sum[2] > n*(n+1)/3)
{
return;
}
int WhichGroup[3] = {1, 2, 3};
random_shuffle(WhichGroup, WhichGroup + 3);
for(int i = 0; i < 3; i++)
{
Group[pos] = WhichGroup[i];
Sum[WhichGroup[i]-1] += pos+1;
recur(pos + 1);
Sum[WhichGroup[i]-1] -= pos+1;
if(found)
return;
}
}
void solve()
{
scanf("%d", &n);
if((n + 2) % 3 == 0)
{
puts("IMPOSSIBLE");
}
else
{
recur(0);
}
}
int main()
{
t = 1;
//scanf("%d", &t);
while(t--)
{
solve();
}
return 0;
}

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
1 3 1 3 2 

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
6

correct output
1 3 2 2 1 3 

user output
1 3 2 2 1 3 

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 1 1 2 1 3 3 2 

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
9

correct output
1 2 3 1 2 3 3 2 1 

user output
1 1 1 3 3 2 3 1 2 

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
1 1 1 3 1 2 2 1 3 2 1 3 2 2 1 ...

Test 10

Group: 2

Verdict:

input
95

correct output
1 3 1 3 2 1 2 3 3 2 1 1 2 3 3 ...

user output
(empty)

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
1 1 1 3 1 2 2 1 3 2 1 3 2 2 1 ...
Truncated

Test 12

Group: 2

Verdict: ACCEPTED

input
97

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 13

Group: 2

Verdict:

input
98

correct output
2 3 1 2 3 3 2 1 1 2 3 3 2 1 1 ...

user output
(empty)

Test 14

Group: 2

Verdict:

input
99

correct output
1 2 3 1 2 3 3 2 1 1 2 3 3 2 1 ...

user output
(empty)

Test 15

Group: 2

Verdict: ACCEPTED

input
100

correct output
IMPOSSIBLE

user output
IMPOSSIBLE