제출 #341205

#제출 시각아이디문제언어결과실행 시간메모리
341205YJUArranging Shoes (IOI19_shoes)C++14
0 / 100
2 ms640 KiB
#include<bits/stdc++.h> //#include"shoes.h" #pragma GCC optimize("unroll-loops,no-stack-protector") using namespace std; typedef long long ll; typedef long double ld; typedef pair<ll,ll> pll; const ll MOD=1e9+7; const ll MOD2=998244353; const ll N=2e6+7; const ll K=350; const ld pi=acos(-1); const ll INF=(1LL<<60); #define SQ(i) ((i)*(i)) #define REP(i,n) for(ll i=0;i<n;i++) #define REP1(i,n) for(ll i=1;i<=n;i++) #define pb push_back #define mp make_pair #define X first #define Y second #define setp setprecision #define lwb lower_bound #define SZ(_a) (ll)_a.size() ll bit[N]; void ins(ll id,ll del){ ++id; for(;id;id+=(id&-id)){ bit[id]+=del; } } ll q(ll id){ ++id; ll sum=0; for(;;id-=(id&-id)){ sum+=bit[id]; } return sum; } ll count_swaps(vector<int> s){ ll ans=0,n=SZ(s),sz=0; map<ll,queue<ll> > m; REP(i,n){ if(SZ(m[-s[i]])){ ans-=(q(i)-q(m[-s[i]].front())); ans+=i-m[-s[i]].front()-1+(s[i]<0?1:0); ins(m[-s[i]].front(),-1); m[-s[i]].pop(); }else{ ins(i,1); m[s[i]].push(i); } } return ans; }

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

shoes.cpp: In function 'll count_swaps(std::vector<int>)':
shoes.cpp:44:19: warning: unused variable 'sz' [-Wunused-variable]
   44 |  ll ans=0,n=SZ(s),sz=0;
      |                   ^~
#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...