oj.uz

Submission #422108

# Submission time Handle Problem Language Result Execution time Memory
422108 2021-06-09T17:48:38 Z Antekb Toy Train (IOI17_train) C++14
23 / 100
 557 ms 99492 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] && czy[j][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 91 ms 15308 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 99132 KB Output is correct
2 Correct 297 ms 99108 KB Output is correct
3 Correct 326 ms 99012 KB Output is correct
4 Correct 509 ms 99492 KB Output is correct
5 Correct 183 ms 89156 KB Output is correct
6 Correct 90 ms 44272 KB Output is correct
7 Correct 557 ms 99240 KB Output is correct
8 Correct 61 ms 15052 KB Output is correct
9 Correct 58 ms 1508 KB Output is correct
10 Correct 75 ms 54520 KB Output is correct
11 Correct 64 ms 24520 KB Output is correct
12 Correct 55 ms 1552 KB Output is correct
13 Correct 62 ms 21532 KB Output is correct
14 Correct 63 ms 21572 KB Output is correct
15 Correct 64 ms 21648 KB Output is correct
16 Correct 63 ms 21580 KB Output is correct
17 Correct 64 ms 21640 KB Output is correct
18 Correct 460 ms 98908 KB Output is correct

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 123 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 61 ms 12100 KB Output is correct
2 Correct 66 ms 21644 KB Output is correct
3 Correct 62 ms 17256 KB Output is correct
4 Correct 64 ms 21500 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 55 ms 1200 KB Output is correct
7 Correct 9 ms 2508 KB Output is correct
8 Correct 7 ms 2124 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 91 ms 15308 KB 3rd lines differ - on the 26th token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -