# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
217290 | lyc | Bridges (APIO19_bridges) | C++14 | 3083 ms | 13416 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 <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i <= (b); ++i)
#define SZ(x) ((int)(x).size())
typedef pair<int,int> ii;
const int MX_N = 5e4+5;
const int MX_M = 1e5+5;
const int MX_Q = 1e5+5;
const int B = 230;
//const int B = 1;
struct Edge {
int s, e, b, w;
};
struct Query {
int t, s, w;
};
int N, M;
ii bridge[MX_M];
int weight[MX_M];
int time_[MX_M];
int Q;
vector<Edge> edges;
vector<Query> queries[MX_Q/B+1];
int ans[MX_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... |