Submission #298847

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
298847	2020-09-14 07:30:45	square1001	Arranging Shoes (IOI19_shoes)	C++14	85 / 100	1046 ms	38776 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 "shoes.h"
#include <map>
#include <cmath>
#include <queue>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
const int inf = 1012345678;
long long count_inversions(int n, vector<int> a, vector<int> b) {
  map<int, int> da, db;
  vector<int> aprecnt(n);
  for(int i = 0; i < n; ++i) {
    aprecnt[i] = da[a[i]]++;
  }
  map<pair<int, int>, int> dats;
  for(int i = 0; i < n; ++i) {
    dats[make_pair(a[i], aprecnt[i])] = i;
  }
  vector<int> perm(n);
  for(int i = 0; i < n; ++i) {
    int bprecnt = db[b[i]]++;
    perm[i] = dats[make_pair(b[i], bprecnt)];
  }
  vector<int> bit(n + 1);
  vector<int> iperm(n);
  for(int i = 0; i < n; ++i) {
    iperm[perm[i]] = i;
  }
  long long ans = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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