CSES - Datatähti 2023 alku

Submission details
Task:	Sadonkorjuu
Sender:	Luc
Submission time:	2022-11-11 13:40:41 +0200
Language:	C++ (C++11)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2	details
#2	ACCEPTED	0.00 s	1, 2	details
#3	ACCEPTED	0.00 s	1, 2	details
#4	ACCEPTED	0.00 s	1, 2	details
#5	ACCEPTED	0.00 s	1, 2	details
#6	WRONG ANSWER	0.01 s	1, 2	details
#7	TIME LIMIT EXCEEDED	--	2	details
#8	WRONG ANSWER	0.00 s	1, 2	details
#9	TIME LIMIT EXCEEDED	--	2	details
#10	ACCEPTED	0.00 s	1, 2	details
#11	ACCEPTED	0.16 s	2	details
#12	TIME LIMIT EXCEEDED	--	2	details
#13	TIME LIMIT EXCEEDED	--	2	details
#14	ACCEPTED	0.13 s	2	details
#15	ACCEPTED	0.01 s	1, 2	details
#16	ACCEPTED	0.00 s	1, 2	details
#17	ACCEPTED	0.00 s	1, 2	details
#18	WRONG ANSWER	0.01 s	1, 2	details
#19	ACCEPTED	0.00 s	1, 2	details
#20	WRONG ANSWER	0.00 s	1, 2	details
#21	TIME LIMIT EXCEEDED	--	2	details
#22	ACCEPTED	0.26 s	2	details
#23	TIME LIMIT EXCEEDED	--	2	details
#24	WRONG ANSWER	0.00 s	1, 2	details
#25	TIME LIMIT EXCEEDED	--	2	details
#26	ACCEPTED	0.00 s	1, 2	details
#27	TIME LIMIT EXCEEDED	--	2	details
#28	ACCEPTED	0.01 s	1, 2	details
#29	TIME LIMIT EXCEEDED	--	2	details
#30	ACCEPTED	0.01 s	1, 2	details
#31	TIME LIMIT EXCEEDED	--	2	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         scanf("%d", &n);
      |         ~~~~~^~~~~~~~~~
input/code.cpp:26:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |                 scanf("%d", &x);
      |                 ~~~~~^~~~~~~~~~
input/code.cpp:34:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |                 scanf("%d %d %d", &x, &y, &z);
      |                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:106:27: warning: 'ln' may be used uninitialized in this function [-Wmaybe-uninitialized]
  106 |                 x = L[ln].first;
      |                     ~~~~~~^~~~~

Code

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;

bool cmp(const tuple<int, int, int> a, const tuple<int, int, int> b){
	return get<0>(a)<get<0>(b);
}
 
int main(){
	//if(!freopen("abcd.tzt", "r", stdin)) printf("F*ck\n");
	int n, i = 0, ii=0, x, y, z;
	ll t;
	scanf("%d", &n);
	vector<int> f;
	int p[n+1];
	pair<int, int> L[n+1];
	int ln;
	ll rl[n+1];
	while(i<=n) p[i++]=0;
	i=0;
	while(i<=n) rl[i++]=0;
	i=0;
	while(i++<n){
		scanf("%d", &x);
		if(x)f.push_back(i);
		else p[i] = 1;
	} 
	pair<int, int> a[n+1];
	tuple<int,int, int> b[2*(n-1)];
	i=1;
	while(i++<n){
		scanf("%d %d %d", &x, &y, &z);
		// list of all edges -> sort -> check where each node starts ends -> store value
		b[ii++]={x,y,z};
		b[ii++]={y,x,z};
	}
	sort(b, b+2*(n-1), cmp);
	i=0;
	ii=1;
	int s = (int) 2*(n-1);
	while(i<s && ii<=n){
		while(get<0>(b[i])!=ii) i++;
		a[ii].first = i;
		a[ii-1].second = i;
		ii++;
	}
	ii--;
	while(get<0>(b[i])==ii) i++;
	a[ii].second = i;
	priority_queue<pair<ll,int>> q;
	int pross[n+1];
	ll dist[n+1];
	i=0;
	ll r=0;
	s = (int)f.size();
	while(i<s){
		if(rl[f[i]]){
			 i++;
			 continue;
		}
		///* [DEBUG]*/printf("%d\n", i);
		// Dijkstra's algorithm (modified)
		ll l = 299999999ll;
		for(int i=0; i <= n; i++) pross[i] = 0;
		for(int i=0; i <= n; i++) dist[i] = 299999999ll;
		dist[f[i]] = 0;
		q.push({0,f[i]});
		while(!q.empty()){
			x = q.top().second; 
			q.pop();
			if(pross[x]) continue;
			if(dist[x]>=l) continue;
			pross[x] = 1;
			// [DEBUG]printf("\n%d:\n", x);
			int iii = a[x].first;
			while(iii<a[x].second){
				if(iii<0)*((int *)0)=2;
				y = get<1>(b[iii]); t = dist[x] + (ll) get<2>(b[iii]);
				//* [DEBUG]*/printf(" 	%d: %lld/%lld  (%lld)\n", y, t, dist[y], l);
				if((t<l) && (t<dist[y])){
					L[y].first = x;
					L[x].second = get<2>(b[iii]);
				//	printf("L[x] = %d\n", get<2>(b[iii]));
					dist[y]=t;
					if(p[y]){
				//		printf("PORT\n");
						l = t;
						ln = y;	
					} else if(rl[y]){ if(dist[y]+rl[y]<l){ 
				//		printf("WHAT?\n");
						L[x].second += rl[y];
						l = dist[y]+rl[y];
						ln = y;
					}}else q.push({-t, y});
				}
				iii++;
			}
		}
		//
		r+=l;
		/*[DEBUG]*///printf("%d : %lld\n",f[i],l);
		rl[f[i]]=l;
		// [DEBUG] printf("%d\n", ln);
		x = L[ln].first;
		l = 0;
		while(x != f[i]){
			// [DEBUG] printf("%d\n", x);
			l += L[x].second;
			//printf("%d, %lld\n", x, l);
			if(!rl[x]){
				r += l;
				rl[x] = l;
			}
			x = L[x].first;
		}
		// [DEBUG] printf("DONE!\n");
		i++;
	}
	printf("%lld", r);
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
`1 0` view save

correct output
`0` view save

user output
`0` view save

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 0 0 0 0 1 2 1 2 3 2 3 4 3 ...` view save

correct output
`0` view save

user output
`0` view save

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
`4 1 0 1 1 1 2 10 2 3 20 2 4 30` view save

correct output
`60` view save

user output
`60` view save

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 1 1 1 0 1 2 10 2 3 20 3 4 30 ...` view save

correct output
`80` view save

user output
`80` view save

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 1 0 1 1 1 2 1 2 3 5 3 4 3 ...` view save

correct output
`6` view save

user output
`6` view save

Test 6

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5506363` view save

user output
`5331841` view save

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1795118520` view save

user output
(empty)

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 0 0 1 0 1 1 0 1 0 1 1 0 0 0 1 ...` view save

correct output
`293576` view save

user output
`293463` view save

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`816932444` view save

user output
(empty)

Test 10

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`3089` view save

user output
`3089` view save

Test 11

Group: 2

Verdict: ACCEPTED

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`40839` view save

user output
`40839` view save

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5683983203973` view save

user output
(empty)

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 1 1 1 1 1 1 0 0 0 1 1 0 1 0 ...` view save

correct output
`58572993` view save

user output
(empty)

Test 14

Group: 2

Verdict: ACCEPTED

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`32755` view save

user output
`32755` view save

Test 15

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`126238345` view save

user output
`126238345` view save

Test 16

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 0 0 1 0 1 1 1 0 0 1 0 1 1 0 ...` view save

correct output
`278678` view save

user output
`278678` view save

Test 17

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 ...` view save

correct output
`34929` view save

user output
`34929` view save

Test 18

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1543963` view save

user output
`1559117` view save

Test 19

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`39606` view save

user output
`39606` view save

Test 20

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 1 0 1 0 1 0 0 0 0 1 1 0 0 0 1 ...` view save

correct output
`321598` view save

user output
`320923` view save

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`978670626` view save

user output
(empty)

Test 22

Group: 2

Verdict: ACCEPTED

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`375218` view save

user output
`375218` view save

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 0 0 0 0 0 1 0 1 0 1 1 ...` view save

correct output
`60422556` view save

user output
(empty)

Test 24

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`291990` view save

user output
`327139` view save

Test 25

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`59607954` view save

user output
(empty)

Test 26

Group: 1, 2

Verdict: ACCEPTED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`990` view save

user output
`990` view save

Test 27

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`199982` view save

user output
(empty)

Test 28

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`7987` view save

user output
`7987` view save

Test 29

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`3137875` view save

user output
(empty)

Test 30

Group: 1, 2

Verdict: ACCEPTED

input
`1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`4657693` view save

user output
`4657693` view save

Test 31

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1652889357` view save

user output
(empty)

Datatähti 2023 alku

Sadonkorjuu

Compiler report

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

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Tasks

Submissions (Luc)