# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
393471 | Nordway | Toll (BOI17_toll) | C++17 | 158 ms | 13248 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 x first
#define y second
#define pb push_back
#define mp make_pair
#define sz(v) v.size()
#define up_b upper_bound
#define low_b lower_bound
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
const int N=5e4+11;
const ll mod=1e9+7;
const int inf=1e9;
int k,n,m,o;
int lef[5][N],rig[5][N];
vector<pair<int,int>>g[N][2];
int ans[N];
int A[N],B[N];
void go(int l,int r,vector<int>orders){
if(l==r){
# | 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... |