Submission #249287

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
249287	2020-07-14 15:22:07	Dilshod_Imomov	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	163 ms	269712 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
26
27
28
29
30
# include <bits/stdc++.h>
# define ll long long
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
 
const int MAX_N = 100007;
 
ll count_swaps( vector < int > s ) {
  speed;
  ll n = s.size(), sz = 0;
  
  ll ans = 0;
  vector < int > ids, used(n);
  vector < queue < int > > vc(4 * MAX_N); 
  for ( int i = 0; i < n; i++ ) {
    s[i] += MAX_N;
    vc[s[i]].push( i );
  }
  // cout << "Done 1" << endl;
  for ( int i = 0; i < n; i++ ) {
    if ( used[i] ) {
      continue;
    }
    s[i] -= MAX_N;
    int l = i, r = vc[-s[i] + MAX_N].front();
    // cout << "Done 2 " << l << ' ' << r << endl;
    vc[ s[i] + MAX_N ].pop();
    int rr = r;
    used[r] = 1;
    vc[-s[i] + MAX_N].pop();
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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