oj.uz

Submission #220102

# Submission time Handle Problem Language Result Execution time Memory
220102 2020-04-07T03:06:29 Z AQT Coin Collecting (JOI19_ho_t4) C++14
0 / 100
 5 ms 384 KB 
#include <bits/stdc++.h>

using namespace std;

int N;
vector<int> v;
deque<int> lst[2];
bool tkn[2][100005];

int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> N;
	long long ans = 0;
	for(int i = 1; i<=2*N; i++){
		int x, y;
		cin >> x >> y;
		y--;
		if(y <= 0){
			ans += -y;
			lst[0].push_back(x);
		}
		else{
			ans += y-1;
			lst[1].push_back(x);
		}
		v.push_back(x);
	}
	sort(v.begin(), v.end());
	sort(lst[0].begin(), lst[0].end());
	sort(lst[1].begin(), lst[1].end());
	for(int i = 0; i<2*N; i+=2){
		int idx = i/2 + 1;
		ans += abs(v[i]-idx);
		ans += abs(v[i+1]-idx);
	}
	//cout << ans << endl;
	for(int i = N; i; i--){
		for(int k = 2*i-1; k>2*i-3; k--){
			//cout << lst[0].size() << " " << lst[1].size() << " " << v[k] << endl;
			if(!tkn[0][i] && (lst[0].size() && lst[0].back() == v[k])){
				lst[0].pop_back();
				tkn[0][i] = 1;
			}
			else if(!tkn[1][i] && (lst[1].size() && lst[1].back() == v[k])){
				lst[1].pop_back();
				tkn[1][i] = 1;
			}
			else if(!tkn[0][i]){
				lst[1].pop_back();
				tkn[0][i] = 1;
				ans++;
			}
			else{
				lst[0].pop_back();
				lst[1][i] = 1;
				ans++;
			}
		}
	}
	cout << ans << "\n";
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Incorrect 4 ms 256 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Incorrect 4 ms 256 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Incorrect 4 ms 256 KB Output isn't correct
7 Halted 0 ms 0 KB -