# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127637 | OptxPrime | Valley (BOI19_valley) | C++11 | 620 ms | 59044 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 <cmath>
#include<vector>
#include <algorithm>
#include <utility>
#include<stack>
#include<queue>
#include<map>
#include <fstream>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
bool color[100010];
vector<int> upd[100010];
bool ispec[100010];
long long dist[100010];
long long dp[100010];
long long inf=100000000000000000;
int par[100010][30];
long long path[100010][30];
int lvl[100010];
int n,s,q,e;
pair<int,int> edge[100010];
/*struct query{
int color,town,id;
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... |