# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1081993 | alexander707070 | Road Closures (APIO21_roads) | C++14 | 2027 ms | 196424 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>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include "roads.h"
#define MAXN 100007
using namespace std;
const long long inf=1e9;
int n,a,b,k,sz[MAXN];
long long sum;
vector<int> toadd[MAXN];
vector< pair<int,int> > v[MAXN],g[MAXN];
long long dp[MAXN][2];
int li[MAXN][2],tim;
struct node{
int l,r,cnt;
long long sum;
};
struct dynamicST{
int num=1;
vector<node> tree={{0,0,0,0},{0,0,0,0}};
void add_node(){
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |