# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
107605 | SYCstudio | Airline Route Map (JOI18_airline) | C++14 | 866 ms | 31560 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 "Alicelib.h"
#include<cstdio>
#include<vector>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;
#define pb push_back
#define mp make_pair
#define ft first
#define sd second
static const int maxN=1024;
static const int BIT=10;//warning
static vector<pair<int,int> > E;
void Alice(int N,int M,int A[],int B[]){
//cout<<"N:"<<N<<" "<<M<<endl;
for (int i=0;i<M;i++) E.pb(mp(A[i],B[i]));
for (int i=0;i<N;i++){
E.pb(mp(i,N+BIT));
for (int j=0;j<BIT;j++)
if (i&(1<<j)) E.pb(mp(i,N+j));
}
for (int i=1;i<BIT;i++) E.pb(mp(N+i-1,N+i));
for (int i=2;i+1<BIT;i++) E.pb(mp(N,N+i));
for (int i=0;i<BIT;i++) E.pb(mp(N+i,N+BIT)),E.pb(mp(N+i,N+BIT+1));
//for (int i=0;i<E.size();i++) cout<<E[i].ft<<" "<<E[i].sd<<endl;
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... |