oj.uz

답안 #283907

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
283907 2020-08-26T09:15:30 Z sofapuden Arranging Shoes (IOI19_shoes) C++14
45 / 100
 111 ms 71676 KB 
#include "shoes.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll count_swaps(vector<int> s) {
	int n = s.size()/2;
	vector<pair<int, queue<int>>> v(n+2, {0,{}});
	ll ans = 0;
	int cn = 0;
	int pairs = 0;
	for(int i = 0; i < 2*n; ++i){
		if(s[i] < 0){
			if(v[abs(s[i])].first <= 0){
				v[abs(s[i])].second.push(cn);
				v[abs(s[i])].first = -1;
				cn++;
			}
			else{
				auto x = v[abs(s[i])].second.front();
				v[abs(s[i])].second.pop();
				if(v[abs(s[i])].second.empty()){
					v[abs(s[i])].first = 0;
				}
				ans+=cn-x;
				ans+=max(0, x-pairs);
				pairs++;
			}	
		}
		else{
			if(v[abs(s[i])].first >= 0){
				v[abs(s[i])].second.push(cn);
				v[abs(s[i])].first = 1;
				cn++;
			}
			else{
				auto x = v[abs(s[i])].second.front();
				v[abs(s[i])].second.pop();
				if(v[abs(s[i])].second.empty()){
					v[abs(s[i])].first = 0;
				}
				ans+=cn-x-1;
				ans+=max(0, x-pairs);
				pairs++;
			}
		}
	}
	return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Incorrect 0 ms 256 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 288 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 1024 KB Output is correct
19 Correct 1 ms 1024 KB Output is correct
20 Correct 8 ms 7424 KB Output is correct
21 Correct 9 ms 7424 KB Output is correct
22 Correct 80 ms 71288 KB Output is correct
23 Correct 78 ms 71288 KB Output is correct
24 Correct 80 ms 71288 KB Output is correct
25 Correct 75 ms 71416 KB Output is correct
26 Correct 78 ms 71288 KB Output is correct
27 Correct 87 ms 71032 KB Output is correct
28 Correct 80 ms 71672 KB Output is correct
29 Correct 78 ms 71676 KB Output is correct
30 Correct 79 ms 71632 KB Output is correct
31 Correct 80 ms 71288 KB Output is correct
32 Correct 78 ms 71672 KB Output is correct
33 Correct 75 ms 71416 KB Output is correct
34 Correct 77 ms 71672 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 0 ms 256 KB Output is correct
37 Correct 77 ms 71672 KB Output is correct
38 Correct 78 ms 71672 KB Output is correct
39 Correct 76 ms 71672 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 96 ms 71280 KB Output is correct
6 Correct 103 ms 71160 KB Output is correct
7 Correct 111 ms 71164 KB Output is correct
8 Correct 78 ms 71672 KB Output is correct
9 Correct 99 ms 71288 KB Output is correct
10 Correct 96 ms 71288 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Incorrect 0 ms 256 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Incorrect 0 ms 256 KB Output isn't correct
21 Halted 0 ms 0 KB -