# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
286646 | stoyan_malinin | Toy Train (IOI17_train) | C++14 | 1172 ms | 50744 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "train.h"
//#include "grader.cpp"
#include <vector>
#include <assert.h>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
const int MAXN = 5005;
int n;
vector <int> adj[MAXN];
int owner[MAXN], charging[MAXN];
int guessSubtask(vector <int> a, vector <int> r, vector <int> u, vector <int> v)
{
bool sub1 = true;
for(int i = 0;i<u.size();i++)
{
if(u[i]!=v[i] && u[i]+1!=v[i])
{
sub1 = false;
break;
}
}
if(sub1==true) return 1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |