oj.uz

답안 #387488

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
387488 2021-04-08T14:17:22 Z kimbj0709 Arranging Shoes (IOI19_shoes) C++14
100 / 100
 230 ms 24524 KB 
#include "shoes.h"
#include<bits/stdc++.h>
using namespace std;
long long int ans = 0;
vector<int> merge_sort(vector<int> vect1){
  if(vect1.size()<=1){
    return vect1;
  }
  vector<int> left,right;
  for(int i=0;i<vect1.size()/2;i++){
    left.push_back(vect1[i]);
  }
  for(int i=vect1.size()/2;i<vect1.size();i++){
    right.push_back(vect1[i]);
  }
  left = merge_sort(left);
  right = merge_sort(right);
  vector<int> curr;
  left.push_back(INT_MAX);
  right.push_back(INT_MAX);
  reverse(left.begin(),left.end());
  reverse(right.begin(),right.end());
  for(int i=0;i<vect1.size();i++){
    if(left.back()<right.back()){
      curr.push_back(left.back());
      left.pop_back();
    }
    else{
      ans += left.size()-1;
      curr.push_back(right.back());
      right.pop_back();
    }
  }
  return curr;
}
long long count_swaps(std::vector<int> s) {
  int n = s.size();
  vector<vector<int> > nexts(s.size()*2+100);
  for(int i=0;i<s.size();i++){
    if(s[i]>0){
      nexts[s[i]].push_back(i);
    }
    else{
      nexts[s[i]*(-1)+n].push_back(i);
    }
  }
  for(int i=0;i<nexts.size();i++){
    reverse(nexts[i].begin(),nexts[i].end());
  }
  vector<int> treated(s.size(),0);
  int currpos = 0;
  vector<int> positions(n,-1);
  for(int i=0;i<n;i++){
    if(treated[i]==1){
      continue;
    }
    if(s[i]<0){
      positions[i] = currpos;
      positions[nexts[s[i]*-1].back()] = currpos+1;
      treated[nexts[s[i]*-1].back()] = 1;
      nexts[s[i]*-1+n].pop_back();
      nexts[s[i]*-1].pop_back();
    }
    else{
      positions[i] = currpos+1;
      positions[nexts[s[i]+n].back()] = currpos;
      treated[nexts[s[i]+n].back()] = 1;
      nexts[s[i]+n].pop_back();
      nexts[s[i]].pop_back();
    }
    currpos += 2;
  }
  merge_sort(positions);
	return ans;
}

Compilation message

shoes.cpp: In function 'std::vector<int> merge_sort(std::vector<int>)':
shoes.cpp:10:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |   for(int i=0;i<vect1.size()/2;i++){
      |               ~^~~~~~~~~~~~~~~
shoes.cpp:13:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |   for(int i=vect1.size()/2;i<vect1.size();i++){
      |                            ~^~~~~~~~~~~~~
shoes.cpp:23:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |   for(int i=0;i<vect1.size();i++){
      |               ~^~~~~~~~~~~~~
shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:39:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |   for(int i=0;i<s.size();i++){
      |               ~^~~~~~~~~
shoes.cpp:47:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |   for(int i=0;i<nexts.size();i++){
      |               ~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 1 ms 364 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 16 ms 2284 KB Output is correct
21 Correct 16 ms 2412 KB Output is correct
22 Correct 152 ms 18920 KB Output is correct
23 Correct 143 ms 19136 KB Output is correct
24 Correct 148 ms 19028 KB Output is correct
25 Correct 139 ms 18520 KB Output is correct
26 Correct 147 ms 19008 KB Output is correct
27 Correct 142 ms 19008 KB Output is correct
28 Correct 140 ms 18776 KB Output is correct
29 Correct 143 ms 18776 KB Output is correct
30 Correct 144 ms 18776 KB Output is correct
31 Correct 147 ms 19016 KB Output is correct
32 Correct 141 ms 18776 KB Output is correct
33 Correct 139 ms 18520 KB Output is correct
34 Correct 142 ms 18776 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 146 ms 18752 KB Output is correct
38 Correct 140 ms 18648 KB Output is correct
39 Correct 150 ms 18668 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 181 ms 24512 KB Output is correct
6 Correct 156 ms 19560 KB Output is correct
7 Correct 181 ms 24524 KB Output is correct
8 Correct 141 ms 19184 KB Output is correct
9 Correct 179 ms 24420 KB Output is correct
10 Correct 174 ms 21708 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 2 ms 364 KB Output is correct
41 Correct 3 ms 492 KB Output is correct
42 Correct 3 ms 492 KB Output is correct
43 Correct 3 ms 492 KB Output is correct
44 Correct 3 ms 492 KB Output is correct
45 Correct 3 ms 492 KB Output is correct
46 Correct 2 ms 492 KB Output is correct
47 Correct 2 ms 492 KB Output is correct
48 Correct 2 ms 492 KB Output is correct
49 Correct 3 ms 492 KB Output is correct
50 Correct 2 ms 492 KB Output is correct
51 Correct 2 ms 492 KB Output is correct
52 Correct 2 ms 492 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 2 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 2 ms 364 KB Output is correct
52 Correct 2 ms 492 KB Output is correct
53 Correct 2 ms 492 KB Output is correct
54 Correct 16 ms 2284 KB Output is correct
55 Correct 16 ms 2412 KB Output is correct
56 Correct 152 ms 18920 KB Output is correct
57 Correct 143 ms 19136 KB Output is correct
58 Correct 148 ms 19028 KB Output is correct
59 Correct 139 ms 18520 KB Output is correct
60 Correct 147 ms 19008 KB Output is correct
61 Correct 142 ms 19008 KB Output is correct
62 Correct 140 ms 18776 KB Output is correct
63 Correct 143 ms 18776 KB Output is correct
64 Correct 144 ms 18776 KB Output is correct
65 Correct 147 ms 19016 KB Output is correct
66 Correct 141 ms 18776 KB Output is correct
67 Correct 139 ms 18520 KB Output is correct
68 Correct 142 ms 18776 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 146 ms 18752 KB Output is correct
72 Correct 140 ms 18648 KB Output is correct
73 Correct 150 ms 18668 KB Output is correct
74 Correct 1 ms 364 KB Output is correct
75 Correct 1 ms 364 KB Output is correct
76 Correct 1 ms 364 KB Output is correct
77 Correct 1 ms 364 KB Output is correct
78 Correct 181 ms 24512 KB Output is correct
79 Correct 156 ms 19560 KB Output is correct
80 Correct 181 ms 24524 KB Output is correct
81 Correct 141 ms 19184 KB Output is correct
82 Correct 179 ms 24420 KB Output is correct
83 Correct 174 ms 21708 KB Output is correct
84 Correct 1 ms 364 KB Output is correct
85 Correct 1 ms 364 KB Output is correct
86 Correct 1 ms 364 KB Output is correct
87 Correct 2 ms 364 KB Output is correct
88 Correct 3 ms 492 KB Output is correct
89 Correct 3 ms 492 KB Output is correct
90 Correct 3 ms 492 KB Output is correct
91 Correct 3 ms 492 KB Output is correct
92 Correct 3 ms 492 KB Output is correct
93 Correct 2 ms 492 KB Output is correct
94 Correct 2 ms 492 KB Output is correct
95 Correct 2 ms 492 KB Output is correct
96 Correct 3 ms 492 KB Output is correct
97 Correct 2 ms 492 KB Output is correct
98 Correct 2 ms 492 KB Output is correct
99 Correct 2 ms 492 KB Output is correct
100 Correct 3 ms 492 KB Output is correct
101 Correct 19 ms 2820 KB Output is correct
102 Correct 18 ms 2412 KB Output is correct
103 Correct 230 ms 24524 KB Output is correct
104 Correct 196 ms 24420 KB Output is correct
105 Correct 204 ms 22096 KB Output is correct
106 Correct 177 ms 24420 KB Output is correct
107 Correct 172 ms 19688 KB Output is correct
108 Correct 171 ms 20200 KB Output is correct
109 Correct 143 ms 19640 KB Output is correct
110 Correct 141 ms 19032 KB Output is correct
111 Correct 182 ms 23780 KB Output is correct
112 Correct 201 ms 23024 KB Output is correct
113 Correct 172 ms 20236 KB Output is correct
114 Correct 179 ms 24420 KB Output is correct
115 Correct 176 ms 24420 KB Output is correct