| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 104919 | Shtef | Torrent (COI16_torrent) | C++14 | 704 ms | 29472 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 <iostream>
#include <utility>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
#define x first
#define y second
#define mp make_pair
int n, tx, ty, dth[300005];
vector <pii> ms[300005];
bool bio[300005];
vector <int> naputu;
pii par[300005];
const ll inf = (ll)1e15;
bool cmp(ll x, ll y){
return x > y;
}
void dfs1(int x, int p){
for(vector <pii>::iterator i = ms[x].begin() ; i != ms[x].end() ; ++i){
pii o = *i;
if(o.x == p || bio[o.y])
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||