제출 #301749

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
301749	2020-09-18 07:25:12	letandat	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	1049 ms	2168 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>
using namespace std;
//3
//-2 2 2 -2 -2 2
int64_t count_swaps(vector <int> a) {
  int n = a.size()/2;
  int ans = 0;
  
  for (int i=0; i<2*n-1; i+=2) {
    if (abs(a[i])==abs(a[i+1])) continue;
    for (int j=i+2; j<2*n; j++) {
      if (abs(a[j]) == abs(a[i])) {
        ans += j-i-1;
        for (int k=j; k>=i+2; k--) {
          a[k] = a[k-1];
        }
        a[i+1] = a[i];
      }
    }
  }
  for (int i=0; i<2*n-1; i+=2) {
    if (a[i] > 0) ans += 1;
  }
  return ans;
}
void test () {
  int n; cin >> n;
  vector<int> a;
  for (int i=0; i<2*n; i++) {
    int c; cin >> c;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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