oj.uz

Submission #423939

# Submission time Handle Problem Language Result Execution time Memory
423939 2021-06-11T14:19:26 Z cfalas Toy Train (IOI17_train) C++14
5 / 100
 7 ms 1520 KB 
#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())

vi who_wins(vi a, vi r, vi u, vi v) {
	int n = len(a);
	vi res(n, 0);
	vi deg(n,0);
	vi loop(n,0);
	FOR(i,len(u)){
		if(u[i]==v[i]) loop[u[i]] = 1;
		deg[u[i]]++;
	}
	assert(loop[n-1]);
	res[n-1] = loop[n-1] && r[n-1];
	for(int i=n-2;i>=0;i--){
		if(deg[i]==1){
			if(loop[i] && r[i]) res[i] = 1;
			else if(loop[i] && !r[i]) res[i] = 0;
			else if(!loop[i] && r[i]) res[i] = res[i+1];
			else if(!loop[i] && !r[i]) res[i] = res[i+1];
		}
		else if(deg[i]==2){
			if(loop[i] && r[i] && a[i]) res[i] = 1;
			else if(loop[i] && r[i] && !a[i]) res[i] = res[i+1];
			else if(loop[i] && !r[i] && a[i]) res[i] = res[i+1];
			else if(loop[i] && !r[i] && !a[i]) res[i] = 0;
			else if(!loop[i] && r[i]) assert(0);
			else if(!loop[i] && !r[i]) assert(0);
		}
	}
	return res;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 588 KB Output is correct
2 Correct 4 ms 588 KB Output is correct
3 Correct 4 ms 588 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 4 ms 588 KB Output is correct
6 Correct 6 ms 588 KB Output is correct
7 Correct 4 ms 716 KB Output is correct
8 Correct 5 ms 588 KB Output is correct
9 Correct 4 ms 588 KB Output is correct
10 Correct 5 ms 588 KB Output is correct
11 Correct 3 ms 560 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 1520 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 1228 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 1484 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 588 KB Output is correct
2 Correct 4 ms 588 KB Output is correct
3 Correct 4 ms 588 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 4 ms 588 KB Output is correct
6 Correct 6 ms 588 KB Output is correct
7 Correct 4 ms 716 KB Output is correct
8 Correct 5 ms 588 KB Output is correct
9 Correct 4 ms 588 KB Output is correct
10 Correct 5 ms 588 KB Output is correct
11 Correct 3 ms 560 KB Output is correct
12 Runtime error 1 ms 332 KB Execution killed with signal 6
13 Halted 0 ms 0 KB -