oj.uz

답안 #390163

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
390163 2021-04-15T13:30:51 Z alishahali1382 장난감 기차 (IOI17_train) C++14
5 / 100
 2000 ms 2764 KB 
#include "train.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define debug(x) {cerr<<#x<<"="<<x<<"\n";}
#define debug2(x, y) {cerr<<#x<<", "<<#y<<" = "<<x<<", "<<y<<"\n";}
#define pb push_back
#define all(x) x.begin(), x.end()

const int inf=1000000100;
const int MAXN=5010;

int n, m, k;
int Q[MAXN], L, R;
bool dead[MAXN], mark[MAXN];
int deg[MAXN];
vector<int> G[MAXN], GR[MAXN];

vector<int> who_wins(vector<int> typ, vector<int> good, vector<int> U, vector<int> V){
	n=typ.size();
	m=U.size();
	vector<int> ans(n, 1);
	for (int i=0; i<m; i++){
		G[U[i]].pb(V[i]);
		GR[V[i]].pb(U[i]);
	}
	int sz=n;
	while (sz){
		memset(mark, 0, sizeof(mark));
		L=R=0;
		// debug("check1")
		for (int i=0; i<n; i++) if (!dead[i]){
			if (good[i]) Q[R++]=i;
			else{
				deg[i]=0;
				for (int j:G[i]) deg[i]+=(!dead[j]);
			}
		}
		// debug("check2")
		while (L<R){
			int v=Q[L++];
			mark[v]=1;
			for (int u:GR[v]) if (!dead[u] && !mark[u]){
				deg[u]--;
				if (typ[u] || !deg[u]) Q[R++]=u;
			}
		}
		if (R==sz) break ;
		// debug("check3")
		L=R=0;
		for (int i=0; i<n; i++) if (!dead[i]){
			if (!mark[i]) Q[R++]=i;
			else{
				deg[i]=0;
				for (int j:G[i]) deg[i]+=(!dead[j]);
			}
		}
		while (L<R){
			int v=Q[L++];
			sz--;
			ans[v]=0;
			dead[v]=1;
			for (int u:GR[v]) if (!dead[u] && ans[u]){
				deg[u]--;
				if (!typ[u] || !deg[u]) Q[R++]=u;
			}
		}
	}

	return ans;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1100 KB Output is correct
2 Correct 6 ms 972 KB Output is correct
3 Correct 5 ms 1064 KB Output is correct
4 Correct 5 ms 1100 KB Output is correct
5 Correct 5 ms 972 KB Output is correct
6 Correct 5 ms 972 KB Output is correct
7 Correct 5 ms 1008 KB Output is correct
8 Correct 6 ms 972 KB Output is correct
9 Correct 5 ms 972 KB Output is correct
10 Correct 5 ms 972 KB Output is correct
11 Correct 4 ms 972 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 9 ms 2764 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1100 KB Output is correct
2 Correct 6 ms 972 KB Output is correct
3 Correct 5 ms 1064 KB Output is correct
4 Correct 5 ms 1100 KB Output is correct
5 Correct 5 ms 972 KB Output is correct
6 Correct 5 ms 972 KB Output is correct
7 Correct 5 ms 1008 KB Output is correct
8 Correct 6 ms 972 KB Output is correct
9 Correct 5 ms 972 KB Output is correct
10 Correct 5 ms 972 KB Output is correct
11 Correct 4 ms 972 KB Output is correct
12 Execution timed out 2084 ms 460 KB Time limit exceeded
13 Halted 0 ms 0 KB -