# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1131099 | 79brue | Port Facility (JOI17_port_facility) | C++20 | 4316 ms | 740736 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void no(){
puts("0");
exit(0);
}
int pos[2'000'000];
int lst[80'000'000], nxt[80'000'000], vCnt;
bool val[80'000'000];
inline void addEdge(int x, int y, int v){
lst[pos[x]] = y, nxt[pos[x]] = ++vCnt, val[pos[x]] = v;
lst[pos[y]] = x, nxt[pos[y]] = ++vCnt, val[pos[y]] = v;
pos[x] = nxt[pos[x]], pos[y] = nxt[pos[y]];
}
struct segTree{
vector<int> vec[1<<22];
int maxLim[1<<22];
void push(int i, int l, int r, int x, int v){
if(l==r){
vec[i].push_back(v);
return;
}
int m = (l+r)>>1;
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... |