CSES - Datatähti 2024 alku - Results
Submission details
Task:Monistus
Sender:iraaz
Submission time:2023-11-03 12:20:42 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#10.38 s1, 2details
#20.00 s1, 2details
#30.00 s1, 2details
#40.00 s1, 2details
#50.00 s1, 2details
#60.00 s1, 2details
#70.00 s1, 2details
#80.37 s2details
#90.00 s2details
#100.00 s2details
#110.00 s2details
#120.00 s2details
#130.01 s2details
#140.38 s2details

Code

#include <iostream>
#include <algorithm>
using namespace std;
struct node {
struct node *parent;
int snowplows;
int going = 0;
};
int main()
{
int slope_count;
cin >> slope_count;
node slopes[slope_count];
node root_node;
root_node.snowplows = 0;
slopes[0] = root_node;
for (int i = 1; i < slope_count; i++) {
int a, b;
cin >> a >> b;
node n;
n.parent = &slopes[a-1];
slopes[b-1] = n;
cout << a << ", " << b << endl;
}
int plows;
int slope_i = 0;
while ( cin >> plows ) {
slopes[slope_i].snowplows = plows;
cout << "Hill " << slope_i << " needs: " << plows << endl;
slope_i++;
}
cout << "Best route code" << endl;
for (int i = slope_count; i--;) {
int needed = max(slopes[i].snowplows, slopes[i].going);
if (i == 0) {
cout << "END " << needed << endl;
break;
}
slopes[i].parent->going += needed;
cout << "index " << i+1 << " --- Plows " << slopes[i].snowplows << " going trough " << slopes[i].going << " needed " << needed << " par " << slopes[i].parent->going << " id " << slopes[i].parent << endl;
}
return 0;
}

Test details

Test 1

Group: 1, 2

Verdict:

input
987654321o987654321p

correct output
oooooooooooooooooooooooooooooo...

user output
(empty)

Test 2

Group: 1, 2

Verdict:

input
1e1o1zo1r1h1y1m1b1mn

correct output
eeoozzorrhhyymmbbmmn

user output
Best route code
END 0

Test 3

Group: 1, 2

Verdict:

input
h4y21n7dz6vr1p4go1ec

correct output
hynnnnynnnndzvrppdzvrppdzvrppg...

user output
Best route code

Test 4

Group: 1, 2

Verdict:

input
bv2olah1h6o4f2mx3z1k

correct output
bvololahhhofmxmxfmxmxofmxmxfmx...

user output
Best route code

Test 5

Group: 1, 2

Verdict:

input
xewpp2f1l6a5jp1v2v1y

correct output
xewppfffllajpvvajpvvajpvvjpjpv...

user output
Best route code

Test 6

Group: 1, 2

Verdict:

input
1v4z1kjm1t6vp5c1m2np

correct output
vvzkkjzkkjmttvpcmmvpcmmvpcmmnc...

user output
Best route code
END 0

Test 7

Group: 1, 2

Verdict:

input
y2bl9cp21v7kgesxm2uv

correct output
yblblcpvvvvkgecpkkkkgecpvvvvkg...

user output
Best route code

Test 8

Group: 2

Verdict:

input
987654321b987654321f987654321u...

correct output
bbbbbbbbbbbbbbbbbbbbbbbbbbbbbb...

user output
(empty)

Test 9

Group: 2

Verdict:

input
agjv4321w9dskvax5ws21r321l9n7d...

correct output
agjvwwwwwwwwwwwwwwwwdskvaxwsds...

user output
Best route code

Test 10

Group: 2

Verdict:

input
4mr1d71k432jt9sddyoy2oq7jvc1bm...

correct output
mrddmrddkkjtjtjtjtjtjtjtjtkkjt...

user output
0, 10
0, 10
0, 10
Best route code
index 4 --- Plows 1431654903 g...
Truncated

Test 11

Group: 2

Verdict:

input
1a1l1m1a1t1gc1yv1x1p1w1x1d1d1p...

correct output
aallmmaattggcyyvxxppwwxxddddpp...

user output
Best route code
END 0

Test 12

Group: 2

Verdict:

input
321e321b321a321r321m321f321s32...

correct output
eeeeeeeebbbbbbbbaaaaaaaarrrrrr...

user output
0, 10
0, 10
0, 10
0, 10
0, 10
...
Truncated

Test 13

Group: 2

Verdict:

input
4321e4321l4321t4321w4321g4321c...

correct output
eeeeeeeeeeeeeeeellllllllllllll...

user output
0, 10
0, 10
0, 10
0, 10
0, 10
...
Truncated

Test 14

Group: 2

Verdict:

input
987654321u987654321p987654321g...

correct output
uuuuuuuuuuuuuuuuuuuuuuuuuuuuuu...

user output
(empty)