# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
582021 | alireza_kaviani | Simurgh (IOI17_simurgh) | C++17 | 1953 ms | 9400 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 "simurgh.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
#define SZ(x) int((x).size())
#define X first
#define Y second
#define sep ' '
const ll MAXN = 510; //TODO: fix MAXN
int n , m , common , mark[MAXN] , H[MAXN] , par[MAXN] , ind[MAXN] , tree[MAXN * MAXN] , ans[MAXN * MAXN];
vector<pii> E , adj[MAXN] , back_edge[MAXN];
int query(int A[]){
vector<int> vec;
for(int i = 0 ; i < m ; i++){
if(A[i]){
vec.push_back(i);
}
}
//assert(SZ(vec) == n - 1);
return count_common_roads(vec);
}
int query_back_edge(vector<pii> &v , int l , int r){
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... |