CSES - Datatähti 2025 alku - Results
Submission details
Task:Kortit I
Sender:ma100
Submission time:2024-11-09 19:28:44 +0200
Language:C++ (C++11)
Status:READY
Result:12
Feedback
groupverdictscore
#1ACCEPTED12
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#2--2, 3details
#3--3details
#4--3details
#5--3details
#6--3details
#7--3details
#8--3details
#9--3details
#10--3details
#11--3details
#12--3details
#13--3details
#14--3details
#15--3details
#16--3details
#17--3details
#18--3details
#19--3details
#20--3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:128:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |             for (int i = 1; i < p->size(); i += 2)
      |                             ~~^~~~~~~~~~~
input/code.cpp:133:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  133 |             for (int i = 0; i < p->size(); i += 2)
      |                             ~~^~~~~~~~~~~
input/code.cpp:100:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  100 |     scanf("%d", &tc);
      |     ~~~~~^~~~~~~~~~~
input/code.cpp:105:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  105 |         scanf("%d %d %d",...

Code

#include <bits/stdc++.h>
using namespace std;
typedef array<int, 3> ti;
class N
{
public:
N *p;
int v;
N(N *pv, int vv) : p(pv), v(vv) {};
};
ti f(int x, int y)
{
ti p = {0, 0, 0};
if (x == y)
{
p[2] = 1;
}
else if (x > y)
{
p[0] = 1;
}
else
{
p[1] = 1;
}
return p;
}
ti tp;
vector<int> *pop(N *rn, vector<int> ad, vector<int> bd, ti gt)
{
int as = ad.size();
int bs = bd.size();
if (as == bs)
{
if (rn && rn->p)
{
ti ts = f(rn->p->v, rn->v);
gt[0] += ts[0];
gt[1] += ts[1];
gt[2] += ts[2];
if (gt[0] > tp[0] || gt[1] > tp[1] || gt[2] > tp[2])
{
return ((vector<int> *)NULL);
}
}
if (as == 0)
{
if (gt == tp)
{
vector<int> *ps = new vector<int>;
ps->reserve(tp[0] + tp[1] + tp[2]);
while (rn && rn->p)
{
int v = rn->v;
int pv = rn->p->v;
ps->push_back(v);
ps->push_back(pv);
rn = rn->p->p;
}
return ps;
}
}
for (int i = 0; i < as; i++)
{
vector<int> an = ad;
int v = an[i];
an.erase(an.begin() + i);
N *nn = new N(rn, v);
vector<int> *fi = pop(nn, an, bd, gt);
if (fi)
return fi;
}
}
else
{
for (int i = 0; i < bs; i++)
{
vector<int> bn = bd;
int v = bn[i];
bn.erase(bn.begin() + i);
N *nn = new N(rn, v);
vector<int> *fi = pop(nn, ad, bn, gt);
if (fi)
return fi;
}
}
return ((vector<int> *)NULL);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int tc;
scanf("%d", &tc);
array<int, 3> cl[tc];
for (int i = 0; i < tc; i++)
{
int n, a, b;
scanf("%d %d %d", &n, &a, &b);
cl[i] = {n, a, b};
}
for (int x = 0; x < tc; x++)
{
array<int, 3> s = cl[x];
int n = s[0];
int a = s[1];
int b = s[2];
tp = {a, b, n - a - b};
vector<int> d;
d.reserve(n);
for (int i = 1; i <= n; i++)
{
d.push_back(i);
}
N *rn = new N((N *)NULL, 0);
vector<int> *p = pop(rn, d, d, {0, 0, 0});
if (p)
{
printf("YES\n");
for (int i = 1; i < p->size(); i += 2)
{
printf("%d ", p->at(i));
}
printf("\n");
for (int i = 0; i < p->size(); i += 2)
{
printf("%d ", p->at(i));
}
printf("\n");
}
else
{
printf("NO\n");
}
}
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
54
4 4 0
3 1 3
3 2 2
4 0 4
...

correct output
NO
NO
NO
NO
NO
...

user output
NO
NO
NO
NO
NO
...

Test 2

Group: 2, 3

Verdict:

input
284
6 1 0
5 0 2
7 1 5
7 7 5
...

correct output
NO
NO
YES
1 2 3 4 5 6 7 
2 3 4 5 6 1 7 
...

user output
(empty)

Test 3

Group: 3

Verdict:

input
955
14 2 10
12 2 5
10 4 9
14 1 13
...

correct output
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 4

Group: 3

Verdict:

input
869
17 12 9
16 8 4
15 9 9
17 11 15
...

correct output
NO
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 5

Group: 3

Verdict:

input
761
18 3 15
19 1 15
18 8 1
19 19 17
...

correct output
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 6

Group: 3

Verdict:

input
925
21 14 21
20 18 18
20 7 6
21 14 9
...

correct output
NO
NO
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 7

Group: 3

Verdict:

input
529
22 3 3
22 17 5
22 6 15
22 22 20
...

correct output
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 8

Group: 3

Verdict:

input
576
23 18 9
23 16 8
23 16 13
23 16 22
...

correct output
NO
NO
NO
NO
NO
...

user output
(empty)

Test 9

Group: 3

Verdict:

input
625
24 2 22
24 15 21
24 6 3
24 21 1
...

correct output
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 10

Group: 3

Verdict:

input
676
25 16 25
25 15 2
25 15 7
25 15 16
...

correct output
NO
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 11

Group: 3

Verdict:

input
729
26 2 18
26 14 18
26 5 18
26 19 13
...

correct output
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 12

Group: 3

Verdict:

input
784
27 26 7
27 14 0
27 14 5
27 14 14
...

correct output
NO
NO
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 13

Group: 3

Verdict:

input
841
28 26 16
28 13 19
28 5 8
28 26 4
...

correct output
NO
NO
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 14

Group: 3

Verdict:

input
900
29 24 15
29 13 2
29 13 7
29 13 16
...

correct output
NO
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 15

Group: 3

Verdict:

input
961
30 24 26
30 12 24
30 4 29
30 24 14
...

correct output
NO
NO
NO
NO
YES
...

user output
(empty)

Test 16

Group: 3

Verdict:

input
1000
15 12 6
33 18 30
44 4 26
6 6 5
...

correct output
NO
NO
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 17

Group: 3

Verdict:

input
1000
45 32 30
4 0 3
46 23 10
71 19 46
...

correct output
NO
NO
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
(empty)

Test 18

Group: 3

Verdict:

input
1000
51 29 37
75 11 72
5 2 4
31 8 26
...

correct output
NO
NO
NO
NO
YES
...

user output
(empty)

Test 19

Group: 3

Verdict:

input
1000
50 20 37
99 45 58
86 79 73
85 70 54
...

correct output
NO
NO
NO
NO
NO
...

user output
(empty)

Test 20

Group: 3

Verdict:

input
1000
26 23 5
73 53 59
64 47 41
80 75 55
...

correct output
NO
NO
NO
NO
NO
...

user output
(empty)