# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68228 | top34051 | Synchronization (JOI13_synchronization) | C++17 | 8055 ms | 50060 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.
//subtask 1
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define X first
#define Y second
const int maxn = 2e5 + 5;
int n,m,q;
vector<pii> way[maxn];
int open[maxn];
vector<pii> edge[maxn];
int res;
int get(int x, int val) {
int l = 0, r = edge[x].size()-1, mid, pos = -1;
while(l<=r) {
mid = (l+r)/2;
if(edge[x][mid].X <= val) {
pos = mid;
l = mid+1;
}
else r = mid-1;
}
if(pos==-1) return 0;
return min(val, edge[x][pos].Y);
}
void solve(int u, int last, int cur) {
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... |