# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336513 | mehrdad_sohrabi | Airline Route Map (JOI18_airline) | C++14 | 0 ms | 0 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>
#include "Alicelib.h"
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < ll , ll >
#define F first
#define S second
#define endl '\n'
//#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#define kill(x) return cout<<x<<'\n', 0;
using namespace std;
void Alice( int n,int m,int A[],int B[]){
vector <int> ras;
for (int i=n;i<n+12;i++){
ras.pb(i);
}
vector <pii> mm;
for (int i=0;i<m;i++){
mm.pb({A[i],B[i]});
}
for (int i=n+1;i<n+11;i++){
mm.pb({n,i});
mm.pb({i,n+11});
}
for (int i=n+2;i<n+11;i++){
mm.pb({i,i-1});
}
for (int i=0;i<n;i++){
mm.pb({i,n+11});
}
for (int i=0;i<n;i++){
for (int j=0;j<10;j++){
if ((i & (1<<j))){
mm.pb({i,n+1+j});
}
}
}
InitG(n+12,mm.size());
for (int i=0;i<mm.size();i++){
MakeG(i, mm[i].F, mm[i].S);
}
/*
cout << n+12 << " " << mm.size() << endl;
for (int i=0;i<mm.size();i++){
cout << mm[i].F << " ";
}
cout << endl;
for (int i=0;i<mm.size();i++){
cout << mm[i].S << " ";
}
*/
}
/*
int a[100],b[100];
int32_t main(){
int n,m;
cin >> n >> m;
for (int i=0;i<m;i++){
cin >> a[i] >> b[i];
}
Alice(n,m,a,b);
}
*/
#include <bits/stdc++.h>
#include "Alicelib.h"
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < ll , ll >
#define F first
#define S second
#define endl '\n'
//#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#define kill(x) return cout<<x<<'\n', 0;
using namespace std;
void Alice( int n,int m,int A[],int B[]){
vector <int> ras;
for (int i=n;i<n+12;i++){
ras.pb(i);
}
vector <pii> mm;
for (int i=0;i<m;i++){
mm.pb({A[i],B[i]});
}
for (int i=n+1;i<n+11;i++){
mm.pb({n,i});
mm.pb({i,n+11});
}
for (int i=n+2;i<n+11;i++){
mm.pb({i,i-1});
}
for (int i=0;i<n;i++){
mm.pb({i,n+11});
}
for (int i=0;i<n;i++){
for (int j=0;j<10;j++){
if ((i & (1<<j))){
mm.pb({i,n+1+j});
}
}
}
InitG(n+12,mm.size());
for (int i=0;i<mm.size();i++){
MakeG(i, mm[i].F, mm[i].S);
}
/*
cout << n+12 << " " << mm.size() << endl;
for (int i=0;i<mm.size();i++){
cout << mm[i].F << " ";
}
cout << endl;
for (int i=0;i<mm.size();i++){
cout << mm[i].S << " ";
}
*/
}
/*
int a[100],b[100];
int32_t main(){
int n,m;
cin >> n >> m;
for (int i=0;i<m;i++){
cin >> a[i] >> b[i];
}
Alice(n,m,a,b);
}
*/