oj.uz

답안 #260381

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
260381 2020-08-10T07:57:01 Z terencehill Arranging Shoes (IOI19_shoes) C++14
10 / 100
 1 ms 384 KB 
#include <bits/stdc++.h>
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define ff first
#define ss second
#define P 1000000007
#define in(x, a, b) (a <= x && x < b)

using namespace std;
using ll = long long;
typedef pair<int, int> ii;
typedef vector<ii> vii; 
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
const ll inf = 1000000001, INF = (ll)1e18 + 1;

void upd(vi &t, int pos, int val) {
	for(int i = pos + 1; i <= t.size(); i += (i&-i)) {
		t[i - 1] += val;
	}
}

int get(vi &t, int pos) {
	int sum = 0;
	for(int i = pos + 1; i > 0; i -= (i&-i)) {
		sum += t[i - 1];
	}
	
	return sum;
}

ll count_swaps(vi a) {
	int n = a.size();
	
	vi t(n, 0);
	for(int i = 0; i < n; i++) upd(t, i, 1);
	
	vi nxt(n);
	vvi u(n + 10, vi(2, -1));
	for(int i = n - 1; i >= 0; i--) {
		nxt[i] = u[abs(a[i])][(a[i] < 0 ? 0 : 1)];
		u[abs(a[i])][(a[i] < 0 ? 1 : 0)] = i;
	}
	
	ll ans = 0;
	for(int i = 0; i < n; i++) {
		if(nxt[i] == -1 || !(get(t, i) - get(t, i - 1))) continue;
		if(a[i] < 0) ans += get(t, nxt[i]) - get(t, i) - 1;
		else ans += get(t, nxt[i]) - get(t, i);
		upd(t, nxt[i], -1);
	}
	
	return ans;
}

//int main(){
//	ios_base::sync_with_stdio(false);
//	int n;
//	cin >> n;
//	
//	vi a(n);
//	for(int i = 0; i < n; i++) cin >> a[i];
//    
//    cout << count_swaps(a) << endl;
//	
//	return 0;
//}

Compilation message

shoes.cpp: In function 'void upd(vi&, int, int)':
shoes.cpp:23:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = pos + 1; i <= t.size(); i += (i&-i)) {
                       ~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 384 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 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Incorrect 0 ms 256 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 0 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 Incorrect 0 ms 256 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 384 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 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Incorrect 0 ms 256 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 384 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 0 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Incorrect 0 ms 256 KB Output isn't correct
15 Halted 0 ms 0 KB -