제출 #306160

#제출 시각아이디문제언어결과실행 시간메모리
306160cheetoseArranging Shoes (IOI19_shoes)C++17
25 / 100
1103 ms2040 KiB
#include <bits/stdc++.h> #define mp make_pair #define pb push_back #define X first #define Y second #define y0 y12 #define y1 y22 #define INF 987654321 #define PI 3.141592653589793238462643383279502884 #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c)) #define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c)) #define MEM0(a) memset((a),0,sizeof(a)); #define MEM_1(a) memset((a),-1,sizeof(a)); #define ALL(a) a.begin(),a.end() #define SYNC ios_base::sync_with_stdio(false);cin.tie(0) using namespace std; typedef long long ll; typedef long double ld; typedef double db; typedef unsigned int uint; typedef unsigned long long ull; typedef pair<int, int> Pi; typedef pair<ll, ll> Pll; typedef pair<ld, ld> Pd; typedef vector<int> Vi; typedef vector<ll> Vll; typedef vector<db> Vd; typedef vector<Pi> VPi; typedef vector<Pll> VPll; typedef vector<Pd> VPd; typedef tuple<int, int, int> iii; typedef tuple<int, int, int, int> iiii; typedef tuple<ll, ll, ll> LLL; typedef vector<iii> Viii; typedef vector<LLL> VLLL; typedef complex<double> base; const int MOD = 998244353; ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; } ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; } ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); } int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 }; int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 }; int b[20],c[20]; ll count_swaps(Vi a){ int n=a.size()/2; if(n<=8){ fup(i,0,2*n-1,1)b[i]=a[i]; sort(b,b+2*n); int ans=INF; do{ bool ok=1; fup(i,0,2*n-1,2){ if(b[i]<0 && b[i+1]>0 && b[i]==-b[i+1])continue; ok=0; } if(!ok)continue; int tt=0; fup(i,0,2*n-1,1)c[i]=a[i]; fup(i,0,2*n-1,1){ fup(j,i,2*n-1,1){ if(c[j]==b[i]){ tt+=j-i; rotate(c+i,c+j,c+j+1); break; } } } ans=min(ans,tt); }while(next_permutation(b,b+2*n)); return ans; } return 1LL*n*(n-1)/2; /*Vi vv; Vi p,m; fup(i,0,2*n-1,1){ if(a[i]>0)p.pb(a[i]); if(a[i]<0)m.pb(-a[i]),vv.pb(i); } ll res=0; fup(i,0,n-1,1)res+=abs(vv[i]-2*i); fup(i,0,n-1,1){ fup(j,i,n-1,1){ if(p[j]==m[i]){ res+=j-i; rotate(p.begin()+i,p.begin()+j,p.begin()+j+1); break; } } } return res;*/ }/* int main() { int n; scanf("%d",&n); Vi v(2*n,-1); fup(i,0,2*n-1,1)scanf("%d",&v[i]); printf("%lld\n",count_swaps(v)); }*/

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

shoes.cpp: In function 'll count_swaps(Vi)':
shoes.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
shoes.cpp:48:3: note: in expansion of macro 'fup'
   48 |   fup(i,0,2*n-1,1)b[i]=a[i];
      |   ^~~
shoes.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
shoes.cpp:53:10: note: in expansion of macro 'fup'
   53 |          fup(i,0,2*n-1,2){
      |          ^~~
shoes.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
shoes.cpp:59:10: note: in expansion of macro 'fup'
   59 |          fup(i,0,2*n-1,1)c[i]=a[i];
      |          ^~~
shoes.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
shoes.cpp:60:10: note: in expansion of macro 'fup'
   60 |          fup(i,0,2*n-1,1){
      |          ^~~
shoes.cpp:10:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
shoes.cpp:61:14: note: in expansion of macro 'fup'
   61 |              fup(j,i,2*n-1,1){
      |              ^~~
#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...