CSES - Datatähti Open 2021

CSES - Datatähti Open 2021 - Results

Submission details
Task:	Split in Three
Sender:	cjoa
Submission time:	2021-01-30 23:15:51 +0200
Language:	C++ (C++17)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	22
#2	ACCEPTED	78

Test results
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.04 s	2	details
#15	ACCEPTED	0.01 s	2	details

Code

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
//#include <queue>
//#include <stack>
//#include <cmath>
//#include <numeric>
//#include <cstring>
#include <cassert>

using namespace std;

#ifdef LOCAL_DEBUG
#include <local_debug.h>
#define DEBUG(...) DBG2::print(#__VA_ARGS__, __LINE__, __VA_ARGS__)
#else
#define DEBUG(...)
#endif

#define SZ(a) int((a).size())
#define REP(i,n) for(int i=0,_n=(n);i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)

typedef long long llong;
typedef vector<int> VI;
typedef vector<VI> VVI;

int N;
int sum;
int target;

unsigned char memo[100][1650][1651];

bool go(int n = 1, int sum1 = 0, int sum2 = 0) {
   if (n > N)
      return sum1 == target-1 && sum2 == target;
   if (sum1 > target-1 || sum2 > target)
      return false;
   unsigned char& res = memo[n-1][sum1][sum2];
   if ((res & 1) == 0) {
      res = 1;
      if (go(n+1, sum1+n, sum2)) {
         res |= 1<<1 | 1<<2;
      }
      else if (go(n+1, sum1, sum2+n)) {
         res |= 1<<1 | 2<<2;
      }
      else if (go(n+1, sum1, sum2)) {
         res |= 1<<1 | 3<<2;
      }
   }
   return (res >> 1) & 1;
}

int main(int argc, char* argv[]) {
   ios_base::sync_with_stdio(false); 
   cin.tie(nullptr);

   cin >> N;
   sum = N*(N+1)/2;
   if ((sum % 3) != 0) {
      cout << "IMPOSSIBLE\n";
      return 0;
   }

   target = sum / 3;

   bool res = go();
   if (res) {
   // cerr << "POSSIBLE\n";
      for (int n = 1, sum1 = 0, sum2 = 0; n <= N; ++n) {
         unsigned char m = memo[n-1][sum1][sum2];
         assert((m >> 1) & 1);
         int g = (m >> 2);
         cout << g << ' ';
         if (g == 1)
            sum1 += n;
         else if (g == 2)
            sum2 += n;
         else
            assert(g == 3);
      }
      cout << '\n';
   }
   else
      cout << "IMPOSSIBLE\n";

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

Datatähti Open 2021

Split in Three

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Tasks

Submissions (cjoa)