Submission #519651

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
519651	2022-01-26 23:49:13	CasperWong	Arranging Shoes (IOI19_shoes)	C++14	50 / 100	1063 ms	139548 KiB

shoes

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
#include<bits/stdc++.h>
using namespace std;
long long count_swaps(vector<int>s){
  long long n=s.size()/2,ans=0;
  queue<long long>pr[2*n+100];
  vector<long long>vec={};
  for(int i=-n;i<=n;i++) while(pr[i+n].size()) pr[i+n].pop();
  for(int i=0;i<2*n;i++) pr[s[i]+n].push(i);
  for(int i=0;i<2*n;i++){
    if(!s[i]) continue;
    if(s[i]>0) ans++;
    vec.push_back(pr[-s[i]+n].front());
    s[pr[-s[i]+n].front()]=0;
    sort(vec.begin(),vec.end());
    reverse(vec.begin(),vec.end());
    while(vec.back()<=i) vec.pop_back();
    for(auto j:vec) if((j>i)&&(j<pr[-s[i]+n].front())) ans--;
    ans+=abs(pr[-s[i]+n].front()-i)-1;
    pr[s[i]+n].pop();
    pr[-s[i]+n].pop();
    if(s[i]==-s[i+1]) i++;
  //  cerr<<ans<<endl;
  }
  return ans;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 20 / 20
• Subtask 6: 0 / 15