oj.uz

Submission #596144

# Submission time Handle Problem Language Result Execution time Memory
596144 2022-07-14T12:15:56 Z kshitij_sodani Toy Train (IOI17_train) C++14
100 / 100
 343 ms 1672 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define a first
#define b second
#define pb push_back
#define endl '\n'


#include "train.h"
vector<int> adj[5001];
vector<int> adj2[5001];

int co[5001];
int vis[5001];
std::vector<int> who_wins(std::vector<int> aa, std::vector<int> bb, std::vector<int> u, std::vector<int> v) {
	int n=aa.size();
	for(int i=0;i<u.size();i++){
		adj[u[i]].pb(v[i]);
		adj2[v[i]].pb(u[i]);
	}
	int ind=-1;
	vector<int> ss;
	for(int i=0;i<n;i++){
		if(bb[i]==1){
			ind=i;
			ss.pb(ind);
		}
	}
	vector<int> cc=bb;

	while(true){
		vector<int> ss;
		queue<int> tt;
		for(int i=0;i<n;i++){
			co[i]=adj[i].size();
			if(cc[i]==1){
				ind=i;
				tt.push(i);
				ss.pb(ind);
				vis[i]=1;
			}
			else{
				vis[i]=0;
			}
		}
		bb=cc;
		while(tt.size()){
			int no=tt.front();
			tt.pop();
			for(auto j:adj2[no]){
				if(vis[j]==0){
					if(aa[j]==1){
						vis[j]=1;
						bb[j]=1;
						tt.push(j);
					}
					else{
						co[j]--;
						if(co[j]==0){
							vis[j]=1;
							bb[j]=1;
							tt.push(j);
						}
					}
				}
			}
		}
		int st=1;
		for(auto j:ss){
			int su=0;
			for(auto jj:adj[j]){
				su+=bb[jj];
			}
			if(aa[j]==1){
				if(su==0){
					st=0;
					cc[j]=0;
					break;
				}
			}
			else{
				if(su<adj[j].size()){
					st=0;
					cc[j]=0;
				}
			}
		}
		if(st==1){
			break;
		}
	}
	
	
	return bb;
	/*for(auto j:adj[ind]){
		if(bb[j]==1){
			for(int i=0;i<n;i++){
				if(bb[i]==1){
					ans[i]=1;
				}
			}
			break;
		}
	}
	return ans;*/
}

Compilation message

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:18:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |  for(int i=0;i<u.size();i++){
      |              ~^~~~~~~~~
train.cpp:83:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     if(su<adj[j].size()){
      |        ~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 1108 KB Output is correct
2 Correct 50 ms 1136 KB Output is correct
3 Correct 49 ms 1108 KB Output is correct
4 Correct 47 ms 1108 KB Output is correct
5 Correct 45 ms 1108 KB Output is correct
6 Correct 49 ms 1116 KB Output is correct
7 Correct 6 ms 1108 KB Output is correct
8 Correct 32 ms 1152 KB Output is correct
9 Correct 42 ms 1120 KB Output is correct
10 Correct 27 ms 1108 KB Output is correct
11 Correct 5 ms 1108 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 0 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 1460 KB Output is correct
2 Correct 95 ms 1660 KB Output is correct
3 Correct 134 ms 1672 KB Output is correct
4 Correct 7 ms 1620 KB Output is correct
5 Correct 36 ms 1564 KB Output is correct
6 Correct 29 ms 1584 KB Output is correct
7 Correct 7 ms 1584 KB Output is correct
8 Correct 7 ms 1588 KB Output is correct
9 Correct 7 ms 1552 KB Output is correct
10 Correct 7 ms 1492 KB Output is correct
11 Correct 9 ms 1492 KB Output is correct
12 Correct 9 ms 1408 KB Output is correct
13 Correct 10 ms 1620 KB Output is correct
14 Correct 7 ms 1620 KB Output is correct
15 Correct 7 ms 1620 KB Output is correct
16 Correct 10 ms 1620 KB Output is correct
17 Correct 7 ms 1580 KB Output is correct
18 Correct 185 ms 1236 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1236 KB Output is correct
2 Correct 8 ms 1236 KB Output is correct
3 Correct 7 ms 1280 KB Output is correct
4 Correct 8 ms 1364 KB Output is correct
5 Correct 11 ms 1292 KB Output is correct
6 Correct 8 ms 1364 KB Output is correct
7 Correct 9 ms 1372 KB Output is correct
8 Correct 6 ms 1280 KB Output is correct
9 Correct 8 ms 1364 KB Output is correct
10 Correct 7 ms 1468 KB Output is correct
11 Correct 7 ms 1364 KB Output is correct
12 Correct 8 ms 1468 KB Output is correct
13 Correct 7 ms 1364 KB Output is correct
14 Correct 6 ms 1236 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1364 KB Output is correct
2 Correct 10 ms 1364 KB Output is correct
3 Correct 10 ms 1364 KB Output is correct
4 Correct 9 ms 1236 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 4 ms 980 KB Output is correct
7 Correct 5 ms 980 KB Output is correct
8 Correct 5 ms 1080 KB Output is correct
9 Correct 4 ms 1108 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 6 ms 980 KB Output is correct

Subtask #6
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 1108 KB Output is correct
2 Correct 50 ms 1136 KB Output is correct
3 Correct 49 ms 1108 KB Output is correct
4 Correct 47 ms 1108 KB Output is correct
5 Correct 45 ms 1108 KB Output is correct
6 Correct 49 ms 1116 KB Output is correct
7 Correct 6 ms 1108 KB Output is correct
8 Correct 32 ms 1152 KB Output is correct
9 Correct 42 ms 1120 KB Output is correct
10 Correct 27 ms 1108 KB Output is correct
11 Correct 5 ms 1108 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 0 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 0 ms 468 KB Output is correct
26 Correct 0 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 57 ms 1460 KB Output is correct
33 Correct 95 ms 1660 KB Output is correct
34 Correct 134 ms 1672 KB Output is correct
35 Correct 7 ms 1620 KB Output is correct
36 Correct 36 ms 1564 KB Output is correct
37 Correct 29 ms 1584 KB Output is correct
38 Correct 7 ms 1584 KB Output is correct
39 Correct 7 ms 1588 KB Output is correct
40 Correct 7 ms 1552 KB Output is correct
41 Correct 7 ms 1492 KB Output is correct
42 Correct 9 ms 1492 KB Output is correct
43 Correct 9 ms 1408 KB Output is correct
44 Correct 10 ms 1620 KB Output is correct
45 Correct 7 ms 1620 KB Output is correct
46 Correct 7 ms 1620 KB Output is correct
47 Correct 10 ms 1620 KB Output is correct
48 Correct 7 ms 1580 KB Output is correct
49 Correct 185 ms 1236 KB Output is correct
50 Correct 6 ms 1236 KB Output is correct
51 Correct 8 ms 1236 KB Output is correct
52 Correct 7 ms 1280 KB Output is correct
53 Correct 8 ms 1364 KB Output is correct
54 Correct 11 ms 1292 KB Output is correct
55 Correct 8 ms 1364 KB Output is correct
56 Correct 9 ms 1372 KB Output is correct
57 Correct 6 ms 1280 KB Output is correct
58 Correct 8 ms 1364 KB Output is correct
59 Correct 7 ms 1468 KB Output is correct
60 Correct 7 ms 1364 KB Output is correct
61 Correct 8 ms 1468 KB Output is correct
62 Correct 7 ms 1364 KB Output is correct
63 Correct 6 ms 1236 KB Output is correct
64 Correct 7 ms 1364 KB Output is correct
65 Correct 10 ms 1364 KB Output is correct
66 Correct 10 ms 1364 KB Output is correct
67 Correct 9 ms 1236 KB Output is correct
68 Correct 1 ms 596 KB Output is correct
69 Correct 4 ms 980 KB Output is correct
70 Correct 5 ms 980 KB Output is correct
71 Correct 5 ms 1080 KB Output is correct
72 Correct 4 ms 1108 KB Output is correct
73 Correct 2 ms 724 KB Output is correct
74 Correct 6 ms 980 KB Output is correct
75 Correct 103 ms 1620 KB Output is correct
76 Correct 137 ms 1660 KB Output is correct
77 Correct 170 ms 1656 KB Output is correct
78 Correct 161 ms 1664 KB Output is correct
79 Correct 160 ms 1620 KB Output is correct
80 Correct 8 ms 1620 KB Output is correct
81 Correct 11 ms 1612 KB Output is correct
82 Correct 16 ms 1616 KB Output is correct
83 Correct 59 ms 1604 KB Output is correct
84 Correct 12 ms 1628 KB Output is correct
85 Correct 12 ms 1576 KB Output is correct
86 Correct 30 ms 1620 KB Output is correct
87 Correct 7 ms 1576 KB Output is correct
88 Correct 50 ms 1600 KB Output is correct
89 Correct 12 ms 1620 KB Output is correct
90 Correct 30 ms 1604 KB Output is correct
91 Correct 74 ms 1620 KB Output is correct
92 Correct 30 ms 1620 KB Output is correct
93 Correct 93 ms 1492 KB Output is correct
94 Correct 66 ms 1620 KB Output is correct
95 Correct 53 ms 1628 KB Output is correct
96 Correct 64 ms 1528 KB Output is correct
97 Correct 176 ms 1652 KB Output is correct
98 Correct 300 ms 1620 KB Output is correct
99 Correct 343 ms 1620 KB Output is correct
100 Correct 215 ms 1292 KB Output is correct