제출 #1223918

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1223918		Malix	장난감 기차 (IOI17_train)	C++20	5 / 100	188 ms	327680 KiB

train

#include "train.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) (x).begin(),(x).end()
 
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

int n;
vi b,c;
vii a;
vi ans;

void dfs(int x){
	if(a[x].size()==0){
		ans[x]=c[x];
		return;
	}
	if(ans[a[x][0]]==-1)dfs(a[x][0]);
	ans[x]=ans[a[x][0]];
}

std::vector<int> who_wins(std::vector<int> B, std::vector<int> R, std::vector<int> U, std::vector<int> V) {
	n=B.size();
	b=B;
	c=R;
	a.resize(n);
	ans.resize(n,-1);
	REP(i,0,U.size()){
		if(U[i]==V[i]&&B[U[i]]==R[U[i]])ans[U[i]]=R[U[i]];
		if(U[i]!=V[i])a[U[i]].PB(V[i]);
	}
	REP(i,0,n)if(ans[i]==-1)dfs(i);
	return ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 11
• Subtask 4: 0 / 11
• Subtask 5: 0 / 12
• Subtask 6: 0 / 51