Submission #296098

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
296098	2020-09-10T09:12:30 Z	Muhammetali	Toy Train (IOI17_train)	C++11	0 / 100	89 ms	2048 KB

train

#include "train.h"
#include <bits/stdc++.h>
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v)
{
	vi res;
	set<int>s[6000];
	for (int i=0;i<sz(u);i++)s[u[i]].ins(v[i]);;
	for (int i=0;i<sz(a);i++)
	{
		ll k=i-1;
		ll jem=0;
		while(1)
		{
			k++;
			if (s[i].count(i)==1 && a[i]==0 && r[i]==0)
			{
				jem=0;
				break;
			}
			if (s[i].count(i)==1 && a[i]==1 && r[i]==1)
			{
				jem=1;
				break;
			}
			if (s[k].count(k+1)==1)k+=1;
			else break;
		}
		res.pb(jem);
	}
	return res;
}

Subtask #1
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	89 ms	1144 KB	3rd lines differ - on the 14th token, expected: '1', found: '0'
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	640 KB	3rd lines differ - on the 2nd token, expected: '1', found: '0'
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	2048 KB	Output is correct
2	Correct	10 ms	1920 KB	Output is correct
3	Correct	10 ms	1920 KB	Output is correct
4	Incorrect	11 ms	1920 KB	3rd lines differ - on the 1st token, expected: '1', found: '0'
5	Halted	0 ms	0 KB	-