Submission #470765

#TimeUsernameProblemLanguageResultExecution timeMemory
470765NhatMinh0208Airline Route Map (JOI18_airline)C++17
100 / 100
865 ms33368 KiB
#ifndef CPL_TEMPLATE #define CPL_TEMPLATE /* Normie's Template v2.5 Changes: Added warning against using pragmas on USACO. */ // Standard library in one include. #include <bits/stdc++.h> using namespace std; // ordered_set library. #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update> // AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.) //#include <atcoder/all> //using namespace atcoder; //Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.) #pragma comment(linker, "/stack:200000000") #pragma GCC optimize("Ofast,unroll-loops,tree-vectorize") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") //File I/O. #define FILE_IN "cseq.inp" #define FILE_OUT "cseq.out" #define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout) //Fast I/O. #define fio ios::sync_with_stdio(0);cin.tie(0) #define nfio cin.tie(0) #define endl "\n" //Order checking. #define ord(a,b,c) ((a>=b)and(b>=c)) //min/max redefines, so i dont have to resolve annoying compile errors. #define min(a,b) (((a)<(b))?(a):(b)) #define max(a,b) (((a)>(b))?(a):(b)) // Fast min/max assigns to use with AVX. // Requires g++ 9.2.0. template<typename T> __attribute__((always_inline)) void chkmin(T& a, const T& b) { a=(a<b)?a:b; } template<typename T> __attribute__((always_inline)) void chkmax(T& a, const T& b) { a=(a>b)?a:b; } //Constants. #define MOD (ll(998244353)) #define MAX 300001 #define mag 320 const long double PI=3.14159265358979; //Pairs and 3-pairs. #define p1 first #define p2 second.first #define p3 second.second #define fi first #define se second #define pii(element_type) pair<element_type,element_type> #define piii(element_type) pair<element_type,pii(element_type)> //Quick power of 2. #define pow2(x) (ll(1)<<x) //Short for-loops. #define ff(i,__,___) for(int i=__;i<=___;i++) #define rr(i,__,___) for(int i=__;i>=___;i--) //Typedefs. #define bi BigInt typedef long long ll; typedef long double ld; typedef short sh; // Binpow and stuff ll BOW(ll a, ll x, ll p) { if (!x) return 1; ll res=BOW(a,x/2,p); res*=res; res%=p; if (x%2) res*=a; return res%p; } ll INV(ll a, ll p) { return BOW(a,p-2,p); } //---------END-------// #endif #include "Alicelib.h" #include <cassert> #include <cstdio> void Alice( int N, int M, int A[], int B[] ){ vector<pii(int)> lmao; for (int i=0;i<M;i++) { lmao.emplace_back(A[i],B[i]); } for (int i=0;i<N;i++) for (int j=0;j<10;j++) { if (i&(1<<j)) lmao.push_back({i,N+j}); } for (int i=0;i<10;i++) { lmao.push_back({N+i,N+10}); } for (int i=1;i<10;i++) { lmao.push_back({N+i-1,N+i}); } for (int i=0;i<N+10;i++) { lmao.push_back({i,N+11}); } InitG(N+12,lmao.size()); int u=-1; for (auto g : lmao) { u++; // cout<<g.fi<<' '<<g.se<<endl; MakeG(u, g.fi, g.se); } // cout<<endl<<endl; }
#ifndef CPL_TEMPLATE #define CPL_TEMPLATE /* Normie's Template v2.5 Changes: Added warning against using pragmas on USACO. */ // Standard library in one include. #include <bits/stdc++.h> using namespace std; // ordered_set library. #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update> // AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.) //#include <atcoder/all> //using namespace atcoder; //Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.) #pragma comment(linker, "/stack:200000000") #pragma GCC optimize("Ofast,unroll-loops,tree-vectorize") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") //File I/O. #define FILE_IN "cseq.inp" #define FILE_OUT "cseq.out" #define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout) //Fast I/O. #define fio ios::sync_with_stdio(0);cin.tie(0) #define nfio cin.tie(0) #define endl "\n" //Order checking. #define ord(a,b,c) ((a>=b)and(b>=c)) //min/max redefines, so i dont have to resolve annoying compile errors. #define min(a,b) (((a)<(b))?(a):(b)) #define max(a,b) (((a)>(b))?(a):(b)) // Fast min/max assigns to use with AVX. // Requires g++ 9.2.0. template<typename T> __attribute__((always_inline)) void chkmin(T& a, const T& b) { a=(a<b)?a:b; } template<typename T> __attribute__((always_inline)) void chkmax(T& a, const T& b) { a=(a>b)?a:b; } //Constants. #define MOD (ll(998244353)) #define MAX 300001 #define mag 320 const long double PI=3.14159265358979; //Pairs and 3-pairs. #define p1 first #define p2 second.first #define p3 second.second #define fi first #define se second #define pii(element_type) pair<element_type,element_type> #define piii(element_type) pair<element_type,pii(element_type)> //Quick power of 2. #define pow2(x) (ll(1)<<x) //Short for-loops. #define ff(i,__,___) for(int i=__;i<=___;i++) #define rr(i,__,___) for(int i=__;i>=___;i--) //Typedefs. #define bi BigInt typedef long long ll; typedef long double ld; typedef short sh; //---------END-------// #endif #include "Boblib.h" #include <cassert> #include <cstdio> vector<int> gt[1012]; vector<int> ancs; int usedd[1012]; void dfs(int x, int p) { ancs.push_back(x); for (auto g : gt[x]) if (usedd[g] && g-p) dfs(g,x); } void Bob( int V, int U, int C[], int D[] ){ int adj[1012][1012]; int arr[1012]; int pos[1012]; int N=V-12; if (N==1) { InitMap(1,0); return; } for (int i=0;i<V;i++) { arr[i]=pos[i]=usedd[i]=0; } for (int i=0;i<V;i++) for (int j=0;j<V;j++) { adj[i][j]=0; } for (int i=0;i<U;i++) { // cout<<C[i]<<' '<<D[i]<<endl; adj[C[i]][D[i]]=1; adj[D[i]][C[i]]=1; gt[C[i]].push_back(D[i]); gt[D[i]].push_back(C[i]); } int i,j,k; for (i=0;i<V;i++) if (gt[i].size() == V-2) break; arr[N+11]=i; pos[i]=N+11; for (i=0;i<V;i++) if (i-arr[N+11] && adj[i][arr[N+11]]==0) break; arr[N+10]=i; pos[i]=N+10; ancs=gt[arr[N+10]]; for (auto g : ancs) { usedd[g]=1; // cout<<g<<' '; } // cout<<endl; for (auto g : ancs) { i=0; for (auto gg : gt[g]) if (usedd[gg]) i++; if (i==1) { j=g; break; } } ancs.clear(); dfs(j,-1); if (gt[ancs[0]].size()<gt[ancs[9]].size()) reverse(ancs.begin(),ancs.end()); for (i=0;i<10;i++) { arr[N+i]=ancs[i]; pos[ancs[i]]=N+i; } for (i=0;i<V;i++) if (!pos[i]) { int u=0,v; for (auto g : gt[i]) { v=pos[g]; if (v>=N && v<N+10) { u+=(1<<(v-N)); } } pos[i]=u; arr[u]=i; } // for (i=0;i<V;i++) {cout<<arr[i]<<' ';} // cout<<endl; // for (i=0;i<V;i++) {cout<<pos[i]<<' ';} // cout<<endl; vector<pii(int)> lmao; for (i=0;i<U;i++) { int u,v; u=pos[C[i]]; v=pos[D[i]]; if (u>=0 && v>=0 && u<N && v<N) { lmao.push_back({u,v}); } } InitMap(N,lmao.size()); for (auto g : lmao) MakeMap(g.fi, g.se); }

Compilation message (stderr)

Alice.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 

Bob.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
Bob.cpp: In function 'void Bob(int, int, int*, int*)':
Bob.cpp:129:40: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  129 |     for (i=0;i<V;i++) if (gt[i].size() == V-2) break;
      |                           ~~~~~~~~~~~~~^~~~~~
Bob.cpp:128:13: warning: unused variable 'k' [-Wunused-variable]
  128 |     int i,j,k;
      |             ^
Bob.cpp:128:11: warning: 'j' may be used uninitialized in this function [-Wmaybe-uninitialized]
  128 |     int i,j,k;
      |           ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...