# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
655662 | haojiandan | Airline Route Map (JOI18_airline) | C++14 | 675 ms | 29092 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 <bits/stdc++.h>
using namespace std;
namespace {
#define MP make_pair
vector<pair<int,int> > ans;
void add(int x,int y) {
ans.push_back(MP(x,y));
}
};
void Alice( int n, int m, int A[], int B[] ) {
for (int i=n;i<=n+9;i++) for (int j=0;j<n;j++) if (j>>(i-n)&1) add(i,j);
for (int i=0;i<m;i++) add(A[i],B[i]);
int s=n+10,t=n+11;
for (int i=0;i<s;i++) add(i,s);
for (int i=n;i<n+9;i++) add(i,i+1);
for (int i=n;i<=n+9;i++) add(t,i);
InitG(t+1,(int)ans.size());
for (int i=0;i<ans.size();i++) MakeG(i,ans[i].first,ans[i].second);
}
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... |