# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
35340 | wan2000 | 도로 건설 사업 (JOI13_construction) | C++14 | 1846 ms | 83880 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>
#define mp make_pair
#define X first
#define Y second
using namespace std;
template<typename T> inline void read(T &x){
x = 0; char ch;
while(!isdigit(ch=getchar()));
do{x=10*x+ch-'0';}while(isdigit(ch=getchar()));
}
typedef long long ll;
const int N = 2e5+111;
int n, m, k, pos[3*N], num, cnt, ID[3*N], Fa[N], eNum;
ll D[3*N], F[N];
struct pt{
int x, y;
ll rx, ry;
pt(){}
pt(int a, int b){
x = a; y = b;
rx = (ll)x; ry = (ll)y;
}
} P[3*N];
# | 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... |