oj.uz

Submission #422102

# Submission time Handle Problem Language Result Execution time Memory
422102 2021-06-09T17:36:26 Z Antekb Toy Train (IOI17_train) C++14
23 / 100
 542 ms 99484 KB 
#include "train.h"
#include<bits/stdc++.h>
#define st first
#define nd second
#define pb(x) push_back(x)
using namespace std;
const int N=5005;
vector<int> E[N], rE[N];
int d[N];
int wsk=0;
int czy[N][N], dobre[N];
int vis[N];
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> uu, std::vector<int> vv) {
	int n=a.size(), m=uu.size();
	std::vector<int> res(n);
	for(int i=0; i<m; i++){
		//cout<<uu[i]<<" "<<vv[i]<<"\n";
		E[uu[i]].pb(vv[i]);
		rE[vv[i]].pb(uu[i]);
	}
	for(int i=0; i<n; i++){
		if(r[i]){
			for(int j=0; j<n; j++)d[j]=E[j].size(), vis[j]=0;
			vector<int> V;
			V.push_back(i);
			for(int j=0; j<V.size(); j++){
				//cout<<i<<" "<<V[j]<<"\n";
				if(j)czy[V[j]][i]=1;
				if(V[j]==i && j!=0)continue;
				int v=V[j];
				for(int u:rE[v]){
					if(a[u] && !vis[u]){
						vis[u]=1;
						V.pb(u);
					}
					if(!a[u] && --d[u]==0){
						V.pb(u);
					}
					//assert(d[u]>=0);
				}
			}
		}
	}
	/*int c=0;
	for(int i=0; i<n; i++)if(r[i])c=i;
	//cout<<c<<"\n";
	for(int i=0; i<n;i++){
		res[i]=czy[i][c]*czy[c][c];
	}*/
	for(int i=0; i<n; i++){
		if(r[i]){
			for(int j=0;j<n; j++){
				if(czy[i][j] && czy[j][i])dobre[i]=1;
			}
		}
	}
	for(int i=0; i<n ;i++){
		for(int j=0; j<n; j++){
			if(czy[i][j] && dobre[j])res[i]=1;
		}
	}
	return res;
}

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:26:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |    for(int j=0; j<V.size(); j++){
      |                 ~^~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 75 ms 15344 KB 3rd lines differ - on the 26th token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 460 KB 3rd lines differ - on the 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 99296 KB Output is correct
2 Correct 276 ms 99116 KB Output is correct
3 Correct 308 ms 99280 KB Output is correct
4 Correct 494 ms 99484 KB Output is correct
5 Correct 168 ms 89224 KB Output is correct
6 Correct 78 ms 44252 KB Output is correct
7 Correct 542 ms 99396 KB Output is correct
8 Correct 50 ms 15392 KB Output is correct
9 Correct 46 ms 1732 KB Output is correct
10 Correct 78 ms 54680 KB Output is correct
11 Correct 55 ms 24636 KB Output is correct
12 Correct 46 ms 1764 KB Output is correct
13 Correct 54 ms 21836 KB Output is correct
14 Correct 61 ms 21856 KB Output is correct
15 Correct 56 ms 21792 KB Output is correct
16 Correct 54 ms 21840 KB Output is correct
17 Correct 54 ms 21836 KB Output is correct
18 Correct 452 ms 99116 KB Output is correct

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 109 ms 4292 KB 3rd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 12120 KB Output is correct
2 Correct 61 ms 21644 KB Output is correct
3 Correct 52 ms 17236 KB Output is correct
4 Correct 53 ms 21540 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 43 ms 1196 KB Output is correct
7 Correct 6 ms 2508 KB Output is correct
8 Correct 7 ms 2172 KB Output is correct
9 Correct 7 ms 2252 KB Output is correct
10 Correct 2 ms 844 KB Output is correct
11 Correct 8 ms 3916 KB Output is correct

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 75 ms 15344 KB 3rd lines differ - on the 26th token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -