Submission #306162

#TimeUsernameProblemLanguageResultExecution timeMemory
306162cheetoseArranging Shoes (IOI19_shoes)C++17
65 / 100
35 ms6648 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 987654321987654321 #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 }; Vi p[100001],m[100001]; bool chk[200000]; ll count_swaps(Vi a){ int n=a.size()/2; if(n>1000)return 1LL*n*(n-1)/2; fdn(i,2*n-1,0,1){ if(a[i]>0)p[a[i]].pb(i); else m[-a[i]].pb(i); } ll res=0; fup(i,0,2*n-1,1){ if(chk[i])continue; if(a[i]>0){ while(chk[m[a[i]].back()])m[a[i]].pop_back(); int j=m[a[i]].back(); int t=j-i; fup(k,i,j,1)if(chk[k])t--; res+=t; chk[i]=chk[j]=1; }else{ while(chk[p[-a[i]].back()])p[-a[i]].pop_back(); int j=p[-a[i]].back(); int t=j-i-1; fup(k,i,j,1)if(chk[k])t--; res+=t; chk[i]=chk[j]=1; } } return res; }/* int main() { int n; scanf("%d",&n); Vi v(2*n); fup(i,0,2*n-1,1)scanf("%d",&v[i]); printf("%lld\n",count_swaps(v)); }*/

Compilation message (stderr)

shoes.cpp: In function 'll count_swaps(Vi)':
shoes.cpp:11:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   11 | #define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
      |                              ^
shoes.cpp:49:2: note: in expansion of macro 'fdn'
   49 |  fdn(i,2*n-1,0,1){
      |  ^~~
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:54:2: note: in expansion of macro 'fup'
   54 |  fup(i,0,2*n-1,1){
      |  ^~~
shoes.cpp:10:30: warning: unnecessary parentheses in declaration of 'k' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
shoes.cpp:60:4: note: in expansion of macro 'fup'
   60 |    fup(k,i,j,1)if(chk[k])t--;
      |    ^~~
shoes.cpp:10:30: warning: unnecessary parentheses in declaration of 'k' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
shoes.cpp:67:4: note: in expansion of macro 'fup'
   67 |    fup(k,i,j,1)if(chk[k])t--;
      |    ^~~
#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...