— Dark mode

Datatähti Open 2021

Split in Three

  • Start: N/A
  • End: N/A
CSES - Datatähti Open 2021 - Results
Submission details
Task:Split in Three
Sender:Bench0310
Submission time:2021-01-31 16:08:58 +0200
Language:C++ (C++17)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED22
#2ACCEPTED78
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
#10ACCEPTED0.01 s2details
#11ACCEPTED0.01 s2details
#12ACCEPTED0.01 s2details
#13ACCEPTED0.01 s2details
#14ACCEPTED0.01 s2details
#15ACCEPTED0.01 s2details

Code

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    vector<string> res={"0","IMPOSSIBLE","2 3","1 2 3","IMPOSSIBLE","3 2 2 1 3","1 3 2 2 1 3","IMPOSSIBLE","2 1 1 2 3 1 2 3","2 1 1 1 1 2 3 2 3","IMPOSSIBLE","1 3 1 1 2 1 1 2 2 3 3","1 1 1 3 1 1 2 1 2 2 3 3","IMPOSSIBLE","1 2 1 1 1 1 1 1 3 2 2 2 3 3","1 1 1 1 1 2 1 1 1 2 2 3 2 3 3","IMPOSSIBLE","2 1 1 3 1 1 1 1 1 1 2 2 2 2 3 3 3","1 1 2 1 1 1 3 1 1 1 1 2 2 2 2 3 3 3","IMPOSSIBLE","1 1 1 1 1 1 1 1 2 1 1 1 2 3 2 2 2 3 3 3","1 2 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 3 3 3 3","IMPOSSIBLE","2 1 1 1 1 2 3 1 1 1 1 1 1 1 2 2 2 2 2 3 3 3 3","1 1 1 1 1 1 1 1 1 2 3 1 1 1 1 2 2 2 2 2 3 3 3 3","IMPOSSIBLE","1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 3 2 2 3 3 3 3","1 3 1 1 1 1 1 1 2 1 1 1 1 1 1 1 2 2 2 2 2 2 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 2 1 1 2 2 2 2 2 2 3 3 3 3 3","2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 2 2 2 2 2 2 2 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 2 2 2 2 2 2 2 3 3 3 3 3 3","1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 2 2 2 2 2 2 2 3 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 2 2 2 2 2 2 2 2 3 3 3 3 3 3","1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 3 2 2 2 2 2 2 2 2 3 3 3 3 3 3","IMPOSSIBLE","1 1 3 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3","1 1 1 1 1 1 1 2 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 3 1 1 1 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3","1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 3 2 2 2 2 2 2 3 3 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 1 3 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3","1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 2 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 3 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3","1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 3 2 2 2 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3","1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 3 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3","3 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3","1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 3 2 2 2 3 3 3 3 3 3 3 3 3 3","1 1 1 1 1 3 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 2 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3","2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 3 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3","1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3","1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 3 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 2 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3","1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3","1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 2 2 2 2 2 2 2 2 2 3 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3","1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 3 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3","1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3","1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 3 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3","1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3","1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3","1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3","1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 3 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3","IMPOSSIBLE","1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3","1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3","IMPOSSIBLE"};
    int n;
    cin >> n;
    cout << res[n] << "\n";
//    int N=100;
//    int lim=(N*(N+1)/2)/3;
//    map<array<int,2>,array<int,3>> m[N+1];
//    m[0][{0,0}]={0,0,0};
//    for(int i=1;i<=N;i++)
//    {
//        cout << "i=" << i << endl;
//        for(auto p:m[i-1])
//        {
//            int a=p.first[0];
//            int b=p.first[1];
//            if(a+i<=lim) m[i][{a+i,b}]={a,b,1};
//            if(b+i<=lim) m[i][{a,b+i}]={a,b,2};
//            m[i][{a,b}]={a,b,3};
//        }
//    }
//    for(int n=1;n<=100;n++)
//    {
//        cout << "\"";
//        int s=(n*(n+1)/2);
//        bool ok=((s%3)==0);
//        int x=s/3;
//        if(ok&&m[n].find({x-1,x})!=m[n].end())
//        {
//            vector<int> res(n+1,0);
//            int a=x-1;
//            int b=x;
//            for(int i=n;i>=1;i--)
//            {
//                auto [pa,pb,g]=m[i][{a,b}];
//                res[i]=g;
//                tie(a,b)={pa,pb};
//            }
//            for(int i=1;i<=n;i++) cout << res[i] << (i<n?" ":"");
//        }
//        else cout << "IMPOSSIBLE";
//        cout << "\"" << endl;
//    }
    return 0;
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
3
view save

correct output
1 2 3 
view save

user output
1 2 3
view save

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
4
view save

correct output
IMPOSSIBLE
view save

user output
IMPOSSIBLE
view save

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
5
view save

correct output
1 3 1 3 2 
view save

user output
3 2 2 1 3
view save

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
6
view save

correct output
1 3 2 2 1 3 
view save

user output
1 3 2 2 1 3
view save

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
7
view save

correct output
IMPOSSIBLE
view save

user output
IMPOSSIBLE
view save

Test 6

Group: 1, 2

Verdict: ACCEPTED

input
8
view save

correct output
2 3 1 2 3 3 2 1 
view save

user output
2 1 1 2 3 1 2 3
view save

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
9
view save

correct output
1 2 3 1 2 3 3 2 1 
view save

user output
2 1 1 1 1 2 3 2 3
view save

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
10
view save

correct output
IMPOSSIBLE
view save

user output
IMPOSSIBLE
view save

Test 9

Group: 2

Verdict: ACCEPTED

input
42
view save

correct output
1 3 2 2 1 3 1 2 3 3 2 1 1 2 3 ...
view save

user output
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view save

Test 10

Group: 2

Verdict: ACCEPTED

input
95
view save

correct output
1 3 1 3 2 1 2 3 3 2 1 1 2 3 3 ...
view save

user output
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
Truncated

Test 11

Group: 2

Verdict: ACCEPTED

input
96
view save

correct output
1 3 2 2 1 3 1 2 3 3 2 1 1 2 3 ...
view save

user output
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
Truncated

Test 12

Group: 2

Verdict: ACCEPTED

input
97
view save

correct output
IMPOSSIBLE
view save

user output
IMPOSSIBLE
view save

Test 13

Group: 2

Verdict: ACCEPTED

input
98
view save

correct output
2 3 1 2 3 3 2 1 1 2 3 3 2 1 1 ...
view save

user output
1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 ...
Truncated

Test 14

Group: 2

Verdict: ACCEPTED

input
99
view save

correct output
1 2 3 1 2 3 3 2 1 1 2 3 3 2 1 ...
view save

user output
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
Truncated

Test 15

Group: 2

Verdict: ACCEPTED

input
100
view save

correct output
IMPOSSIBLE
view save

user output
IMPOSSIBLE
view save

Tasks

A Greater Integers-B Split in Three-C Sorting-D Distances-E Programmers-F Polygonal Chain-

Submissions (Bench0310)

0:38:18 100