oj.uz

답안 #617981

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
617981 2022-08-01T18:35:48 Z chirathnirodha 장난감 기차 (IOI17_train) C++17
0 / 100
 2000 ms 98888 KB 
#include "train.h"
#include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define P push

int n,m;
vector<int> ed[5000];
bool own[5000];
bool charge[5000];
bool self[5000];
vector<int> are,bor;

vector<int> SUB_1() {
	vector<int> ans(n);
	for(int i=0;i<n;i++){
		for(int j=i;j<n;j++){
			if(self[j] && ed[j].size()==1){
				if(charge[j])ans[i]=1;
				else ans[i]=0;
				break;
			}
			if(own[j] && charge[j] && self[j]){ans[i]=1;break;}
			if(!own[j] && !charge[j] && self[j]){ans[i]=0;break;}
		}
	}
	return ans;
}

vector<int> SUB_3(){
	int dp[n][n];memset(dp,-1,sizeof(dp));
	for(int i=0;i<n;i++){
		for(int j=0;j<ed[i].size();j++){
			dp[i][j]=0;
			if(charge[i] || charge[j])dp[i][j]=1;
		}
	}
	for(int k=0;k<n;k++){
		for(int i=0;i<n;i++){
			for(int j=0;j<n;j++){
				if(dp[i][k]==-1 || dp[k][j]==-1 || dp[i][j]==1)continue;
				if(charge[k] || dp[i][k]>0 || dp[k][j]>0)dp[i][j]=1;
				else dp[i][j]=0;
			}
		}
	}
	vector<int> ans(n);
	for(int i=0;i<n;i++){
		if(dp[i][i]==1)ans[i]=1;
		else ans[i]=0;
	}
  	return ans;
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	n=a.size();m=u.size();
	memset(self,false,sizeof(self));
	for(int i=0;i<m;i++){
		ed[u[i]].PB(v[i]);
		if(u[i]==v[i])self[u[i]]=true;
	}
	for(int i=0;i<n;i++){
		own[i]=a[i];
		charge[i]=r[i];
		if(a[i])are.PB(i);
		else bor.PB(i);
	}
	if(bor.size()==0)return SUB_3();
	else return SUB_1();
}

Compilation message

train.cpp: In function 'std::vector<int> SUB_3()':
train.cpp:36:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |   for(int j=0;j<ed[i].size();j++){
      |               ~^~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 3 ms 820 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 3 ms 848 KB Output is correct
8 Execution timed out 2081 ms 98520 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 10 ms 980 KB 3rd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 1088 KB 3rd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 4 ms 724 KB Output is correct
5 Correct 3 ms 820 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 3 ms 848 KB Output is correct
8 Execution timed out 2081 ms 98520 KB Time limit exceeded
9 Halted 0 ms 0 KB -