제출 #471258

#제출 시각아이디문제언어결과실행 시간메모리
471258NhatMinh0208Table Tennis (info1cup20_tabletennis)C++17
0 / 100
3086 ms6220 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 vector<int> vec; int n,m,i,j,k,t,t1,u,v,a,b; ll cur,minn; int cb,cs; int mb,ms; int pos[200001]; int arr[200001]; ll val[17][2]; void tri(int x, vector<int> v) { vector<int> vv[2]; ll a=0,b=0; int xx=(x+t)%n; for (auto g : v) { if (g&(1<<xx)) { a++; vv[1].push_back(g); } else { b+=a; vv[0].push_back(g); } } val[x][0]+=b; val[x][1]+=(ll)(vv[0].size())*((ll)(vv[1].size()))-b; if (x) { tri(x-1,vv[0]); tri(x-1,vv[1]); } } int main() { fio; cin>>n; if (n==0) {cout<<0; return 0;} for (i=0;i<(1<<n);i++) { cin>>u; arr[u]=i; } u=0; for (i=0;i<(1<<n);i++) { vec.push_back(arr[i]); } minn=1e18; for (t=0;t<n;t++) { cur=0; cb=0; cs=t; for (i=0;i<n;i++) val[i][0]=val[i][1]=0; tri(n-1,vec); for (i=0;i<n;i++) { if (val[i][0]>val[i][1]) { cb^=(1<<i); } cur+=min(val[i][0],val[i][1]); } if (cur<minn) { // cout<<"fuck\n"; ms=cs; mb=cb; } minn=min(minn,cur); } cout<<minn<<endl; u=0; // cout<<ms<<' '<<mb<<endl; for (i=0;i<ms;i++) { v=u&1; u>>=1; u^=(1<<(n-1))*(v); cout<<2; } for (i=0;i<n;i++) { if ((mb&(1<<i)) == (u&(1<<i))) { cout<<2; } else cout<<2<<1; } } // Normie28; /* 2 3 7 6 1 4 5 0 7 4 0 1 5 6 3 2 3 0 4 5 1 2 7 6 0S 1 2 1 0 */

컴파일 시 표준 에러 (stderr) 메시지

tabletennis.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...