Submission #295973

# Submission time Handle Problem Language Result Execution time Memory
295973 2020-09-10T06:48:14 Z Gurban Toy Train (IOI17_train) C++17
0 / 100
7 ms 1280 KB
#include "train.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ss second
#define ff first
#define sz(a) int(a.size())
#define all(a) a.begin(),a.end()
typedef long double ld;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const ll inf = 1e18;
const int mod = 1e9+7; //998244353;
const int maxn = 5e3+5;
const int Xg[4] = {1,0,-1,0}, Yg[4] = {0,1,0,-1};
ll modpw(ll a,ll e) {if(e==0)return 1;ll x=modpw(a*a%mod,e>>1);return e&1?x*a%mod:x;}

int N,M;
int jog,jog1;
int s[maxn],nx[maxn];

vi who_wins(vi a, vi r, vi u, vi v) {
	
	N = sz(r),M = sz(u);
	
	for(int i = 0;i < M;i++){
		if(u[i]==v[i]) s[i]=1;
		if(v[i]==u[i]+1) nx[i]=1;
	}
	// for(int i = 0;i < N;i++) cout<<s[i]<<' ';
	// cout<<'\n';
	// for(int i = 0;i < N;i++) cout<<nx[i]<<' ';
	// cout<<'\n';
	

	vi ans;

	for(int i = 0;i < N;i++){
		int now = i;;
		bool tr=0;
		while(1){
			if(s[now] and r[now]) tr=1;
			if(nx[now]) now=now+1;
			else break;
		}
		ans.pb(tr);
	}
	return ans;
}
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 512 KB WA in grader: Wrong returned array size
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB 3rd lines differ - on the 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 1280 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 1024 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 1280 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 512 KB WA in grader: Wrong returned array size
2 Halted 0 ms 0 KB -