# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
132273 | gs14004 | Wild Boar (JOI18_wild_boar) | C++17 | 7147 ms | 567428 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;
const int MAXN = 2005;
const int MAXL = 100005;
const int MAXT = 270000;
using lint = long long;
using pi = pair<lint, int>;
struct edg{
int pos, idx, cost;
};
int n, m, q, l;
vector<edg> gph[MAXN];
lint dist[MAXN * 2][MAXN * 2];
struct path_info{
int midl, midr;
lint cost;
bool operator<(const path_info &p)const{
return cost < p.cost;
}
};
vector<path_info> plist[MAXN][MAXN];
int ed[MAXN * 2], cost[MAXN * 2];
void preprocess(){
for(int i=0; i<m; i++){
int s, e, x; scanf("%d %d %d",&s,&e,&x);
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... |