oj.uz

Submission #422137

# Submission time Handle Problem Language Result Execution time Memory
422137 2021-06-09T18:39:08 Z Antekb Toy Train (IOI17_train) C++14
28 / 100
 581 ms 117384 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], E2[N], rE2[N];
int d[N];
int wsk=0;
int czy[N][N], dobre[N], petla[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";
		if(uu[i]==vv[i])petla[uu[i]]=1;
		else{
			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()+petla[j]*(1-a[j])*(1-r[j]), 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);
				}
				if(j==0 && petla[i] && (a[i]||E[i].empty()))V.pb(i);
			}
		}
	}
	/*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];
	}*/
	
	vector<int> V;
	for(int i=0; i<n; i++){
		if(r[i]){
			for(int j=0;j<n; j++){
				if(czy[i][j])E2[j].pb(i);
			}
		}
	}
	for(int i=0; i<n; i++)if(r[i]){
		vis[i]=0;
		if(czy[i][i])V.pb(i), vis[i]=1;
	}
	for(int i=0; i<V.size(); i++){
		int v=V[i];
		//cout<<v<<"\n";
		for(int u:E2[v]){
			if(!vis[u]){
				vis[u]=1;
				V.pb(u);
			}
		}
	}
	/*for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
			cout<<czy[j][i];
		}
		cout<<"\n";
	}*/
	for(int i=0; i<n ;i++){
		for(int j=0; j<n; j++){
			if(czy[i][j] && vis[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:29:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |    for(int j=0; j<V.size(); j++){
      |                 ~^~~~~~~~~
train.cpp:67:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |  for(int i=0; i<V.size(); i++){
      |               ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 17116 KB Output is correct
2 Correct 100 ms 17452 KB Output is correct
3 Correct 123 ms 17496 KB Output is correct
4 Correct 100 ms 17508 KB Output is correct
5 Correct 119 ms 16996 KB Output is correct
6 Correct 100 ms 16596 KB Output is correct
7 Correct 122 ms 13448 KB Output is correct
8 Correct 108 ms 20656 KB Output is correct
9 Correct 98 ms 15084 KB Output is correct
10 Correct 115 ms 12976 KB Output is correct
11 Correct 97 ms 11432 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 716 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 213 ms 100132 KB Output is correct
2 Correct 271 ms 102348 KB Output is correct
3 Correct 314 ms 106436 KB Output is correct
4 Correct 494 ms 109756 KB Output is correct
5 Correct 182 ms 90064 KB Output is correct
6 Correct 90 ms 44740 KB Output is correct
7 Correct 581 ms 116652 KB Output is correct
8 Correct 64 ms 15436 KB Output is correct
9 Correct 58 ms 1968 KB Output is correct
10 Correct 77 ms 54980 KB Output is correct
11 Correct 83 ms 24868 KB Output is correct
12 Correct 60 ms 1948 KB Output is correct
13 Correct 73 ms 22096 KB Output is correct
14 Correct 66 ms 22084 KB Output is correct
15 Correct 66 ms 22104 KB Output is correct
16 Correct 66 ms 22104 KB Output is correct
17 Correct 65 ms 22012 KB Output is correct
18 Correct 499 ms 117384 KB Output is correct

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 132 ms 4676 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 64 ms 12408 KB Output is correct
2 Correct 68 ms 22084 KB Output is correct
3 Correct 69 ms 17936 KB Output is correct
4 Correct 66 ms 21972 KB Output is correct
5 Correct 1 ms 912 KB Output is correct
6 Correct 60 ms 1512 KB Output is correct
7 Correct 7 ms 2892 KB Output is correct
8 Correct 10 ms 2444 KB Output is correct
9 Correct 7 ms 2636 KB Output is correct
10 Correct 2 ms 1192 KB Output is correct
11 Correct 8 ms 4240 KB Output is correct

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 17116 KB Output is correct
2 Correct 100 ms 17452 KB Output is correct
3 Correct 123 ms 17496 KB Output is correct
4 Correct 100 ms 17508 KB Output is correct
5 Correct 119 ms 16996 KB Output is correct
6 Correct 100 ms 16596 KB Output is correct
7 Correct 122 ms 13448 KB Output is correct
8 Correct 108 ms 20656 KB Output is correct
9 Correct 98 ms 15084 KB Output is correct
10 Correct 115 ms 12976 KB Output is correct
11 Correct 97 ms 11432 KB Output is correct
12 Incorrect 1 ms 716 KB 3rd lines differ - on the 2nd token, expected: '1', found: '0'
13 Halted 0 ms 0 KB -