# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
198046 | Andrei_Cotor | Toll (BOI17_toll) | C++14 | 270 ms | 24952 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<iostream>
#include<vector>
using namespace std;
vector<pair<int,int> > A[50005],Qu[50005];
int k,DpSt[50005][7][7],DpDr[50005][7][7],Rez[10005];
pair<int,int> Q[10005];
void solve(int st, int dr)
{
if(st==dr)
{
for(auto qu:Qu[st])
{
if(qu.first!=st)
continue;
if(Q[qu.second].first==Q[qu.second].second)
Rez[qu.second]=0;
}
return;
}
int mij=(st+dr)/2;
for(int i=st; i<=mij; i++)
for(int j=0; j<k; j++)
for(int ind=0; ind<k; ind++)
DpSt[i][j][ind]=1000000000;
# | 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... |