# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
56266 | ngkan146 | Toy Train (IOI17_train) | C++11 | 943 ms | 100444 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 <bits/stdc++.h>
using namespace std;
#define AREZOU 1
#define BORZOU 0
int n, m;
vector <int> G[5005];
vector <int> Gback[5005];
int owner[5005];
int chargingStation[5005];
int result[5005];
int deg[5005];
bool visited[5005], ok[5005], del[5005];
void solve(vector <int> lst){
memset(deg, 0, sizeof(deg));
memset(visited, 0, sizeof(visited));
memset(ok, 0, sizeof(ok));
for(auto u: lst){
ok[u] = 1;
for(auto v: Gback[u]){
if (!del[v]) deg[v] ++;
}
}
vector <int> goodForArezou;
vector <int> goodForBorzou;
queue <int> q;
# | 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... |