oj.uz

답안 #1025840

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1025840 2024-07-17T10:42:41 Z amirhoseinfar1385 장난감 기차 (IOI17_train) C++17
0 / 100
 2000 ms 1884 KB 
#include "train.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=30000+10;
vector<int>adj[maxn];
int n,shar[maxn],arez[maxn],m,dp[maxn],vas[maxn],dide[maxn];

std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
	n=(int)a.size();
	m=(int)u.size();
	for(int i=0;i<=n;i++){
		adj[i].clear();
		shar[i]=vas[i]=dide[i]=dp[i]=arez[i]=0;
	}
	for(int i=0;i<n;i++){
		if(a[i]){
			arez[i]=1;
		}
		if(r[i]){
			shar[i]=1;
		}
	}
	for(int i=0;i<m;i++){
		adj[u[i]].push_back(v[i]);
	}
	for(int nago=0;nago<=n;nago++){
	for(int i=0;i<n;i++){
		dp[i]=shar[i];
	}
	for(int asd=0;asd<=n;asd++){
		for(int i=0;i<n;i++){
			if(shar[i]){
				continue;
			}
			int cnt=0;
			int f=0;
			for(auto x:adj[i]){
				if(dp[x]==1){
					cnt++;
				}
			}
			if(arez[i]){
				if(cnt>0){
					dp[i]=1;
				}else{
					dp[i]=0;
				}
			}else{
				if(cnt!=(int)adj[i].size()){
					dp[i]=0;
				}else{
					dp[i]=1;
				}
			}
		}
	}
	if(nago!=n){
		for(int i=0;i<n;i++){
			if(shar[i]==1){
				int cnt=0;
				for(auto x:adj[i]){
					if(dp[x]==1){
						cnt++;
					}
				}
				shar[i]=(cnt>=1);
			}
		}
	}
	}
	vector<int>res(n);
	for(int i=0;i<n;i++){
		res[i]=dp[i];
	}
	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:36:8: warning: unused variable 'f' [-Wunused-variable]
   36 |    int f=0;
      |        ^

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2068 ms 1372 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Incorrect 0 ms 1116 KB 3rd lines differ - on the 3rd token, expected: '0', found: '1'
4 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2081 ms 1884 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2017 ms 1628 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2048 ms 1880 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2068 ms 1372 KB Time limit exceeded
2 Halted 0 ms 0 KB -