CSES - Datatähti Open 2021 - Results
Submission details
Task:Sorting
Sender:gilgamesh
Submission time:2021-01-30 23:27:38 +0200
Language:C++11
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#10.01 s1, 2details
#20.01 s2details
#30.01 s1, 2details
#40.01 s1, 2details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:14:7: warning: unused variable 'a' [-Wunused-variable]
   int a[n];
       ^
input/code.cpp:20:24: warning: unused variable 'y' [-Wunused-variable]
   int x = sum / 3 - 1, y = sum / 3, z = sum / 3 + 1;
                        ^
input/code.cpp:20:37: warning: unused variable 'z' [-Wunused-variable]
   int x = sum / 3 - 1, y = sum / 3, z = sum / 3 + 1;
                                     ^

Code

#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define all(x) (x).begin(),(x).end()
#define pb push_back

signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n; cin >> n;
  int ans[n];
  fill(ans, ans + n, 0);
  int a[n];
  int sum = n * (n + 1) / 2;
  if(sum % 3) {
    cout << "IMPOSSIBLE\n";
    return 0;
  }
  int x = sum / 3 - 1, y = sum / 3, z = sum / 3 + 1;
  if(x == 0) {
    cout << "IMPOSSIBLE\n";
    return 0;
  }
  if(n % 3 == 0) {
    int div = n / 3;
    int perm[3] = {1, 2, 3};
    for(int i = 0; i + 6 <= n; i += 6) {
      for(int j = 0; j < 2; ++j) {
        for(int k = 0; k < 3; ++k) {
          ans[i + j * 3 + k] = perm[k];
        }
        swap(perm[0], perm[2]);
      }
    }
    if(div % 2 == 0) {
      ans[0] = 3;
    } else {
      for(int i = n - 3; i < n; ++i) {
        ans[i] = perm[i - (n - 3)];
      }
    }
    for(int i = 0; i < n; ++i) {
      cout << ans[i] << " ";
    }
    cout << "\n";
  } else {
    ans[0] = 2;
    ans[1] = 3;
    int perm[3] = {2, 1, 3};
    for(int i = 2; i < n; i += 3) {
      for(int j = i; j <= i + 2; ++j) {
        ans[j] = perm[2 - (j - i)];
      }
      rotate(perm, perm + 1, perm + 3);
    }
    int sum[4];
    fill(sum, sum + 4,0);
    for(int i = 0; i < n; ++i) {
      sum[ans[i]] += i + 1;
    }
    if(sum[1] == sum[2] && sum[2] == sum[3]) {
      ans[0]++;
      if(ans[0] == 4) ans[0] = 1;
    }
    vector<array<int, 2>> p;
    for(int i = 1; i <= 3; ++i) {
      p.pb({sum[i], i});
    }
    sort(all(p));
    for(int i = 0; i < n; ++i) {
      ans[i] = p[ans[i] - 1][1];
      cout << ans[i] << " ";
    }
    cout << "\n";
  }
}

Test details

Test 1

Group: 1, 2

Verdict:

input
153
1
1
2
1 2
...

correct output
YES
YES
NO
NO
NO
...

user output
1 2 3 3 2 1 1 2 3 3 2 1 1 2 3 ...

Test 2

Group: 2

Verdict:

input
1000
59
35 29 32 50 11 15 9 21 19 45 2...

correct output
YES
NO
YES
NO
YES
...

user output
IMPOSSIBLE

Test 3

Group: 1, 2

Verdict:

input
720
6
1 6 4 5 2 3
6
6 3 2 1 5 4
...

correct output
YES
NO
NO
NO
YES
...

user output
3 2 3 3 2 1 1 2 3 3 2 1 1 2 3 ...

Test 4

Group: 1, 2

Verdict:

input
1000
8
7 4 2 8 6 3 5 1
8
3 8 2 7 5 4 6 1
...

correct output
NO
NO
YES
NO
YES
...

user output
IMPOSSIBLE