답안 #424152

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
424152	2021-06-11T17:22:43 Z	cfalas	장난감 기차 (IOI17_train)	C++14	0 / 100	1089 ms	50704 KB

train

#include "train.h"
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto &v : a)
#define len(x) ((int)x.size())

int c=0;
vector<vi> adj;
vector<vi> rev;
vi vis;

vector<int> path;
vii loops;
vector<vi> paths;
void dfs(int s){
	path.push_back(s);
	vis[s] = c;
	paths[s] = path;
	for(auto v : adj[s]){
		if(!vis[v]) dfs(v);
		else if(vis[v]==c){
			loops.push_back({s,v});
		}
	}
	path.erase(path.end()-1);
}

vi who_wins(vi a, vi r, vi u, vi v) {
	int n = len(a);
	adj.assign(n, vi());
	rev.assign(n, vi());
	paths.resize(n);
	vis.assign(n,0);
	vi res(n, 0);

	FOR(i, len(u)){
		adj[u[i]].push_back(v[i]);
		rev[v[i]].push_back(u[i]);
	}
	FOR(i,n){
		if(!vis[i]){
			c++, dfs(i);
		}
	}

	FOA(loop, loops){
		bool start = false;
		bool win = false;
		vi path;
		//cout<<loop.F<<" "<<loop.S<<": ";
		FOA(v,paths[loop.F]){
			if(v==loop.S) start = true;
			if(start){
				if(r[v]) win = true;
				path.push_back(v);
			}
		}
		//FOA(v,path) cout<<v<<" ";
		//cout<<endl;
		if(win){
			queue<int> q;
			vi used(n, 0);
			FOA(v,path) q.push(v), used[v] = true;
			while(!q.empty()){
				int t = q.front();
				q.pop();
				res[t] = 1;
				FOA(v,rev[t]){
					if(!used[v]){
						used[v] = true;
						q.push(v);
					}
				}
			}
		}
	}

	return res;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	22 ms	22860 KB	Output is correct
2	Correct	21 ms	18972 KB	Output is correct
3	Correct	20 ms	16952 KB	Output is correct
4	Correct	1089 ms	33100 KB	Output is correct
5	Correct	618 ms	19860 KB	Output is correct
6	Correct	18 ms	5448 KB	Output is correct
7	Correct	363 ms	3016 KB	Output is correct
8	Correct	14 ms	4296 KB	Output is correct
9	Correct	12 ms	4140 KB	Output is correct
10	Correct	17 ms	3148 KB	Output is correct
11	Correct	11 ms	2252 KB	Output is correct
12	Correct	9 ms	1868 KB	Output is correct
13	Correct	419 ms	39012 KB	Output is correct
14	Incorrect	89 ms	38672 KB	3rd lines differ - on the 1st token, expected: '1', found: '0'
15	Halted	0 ms	0 KB	-