oj.uz

Submission #82690

# Submission time Handle Problem Language Result Execution time Memory
82690 2018-11-01T11:06:40 Z heon Unija (COCI17_unija) C++11
60 / 100
 431 ms 66560 KB 
#include<bits/stdc++.h>

using namespace std;
int main(){
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n;
	cin >> n;
	vector <pair<int,int>> v;
	for(int i = 0; i < n; i++){
		int x,y;
		cin >> x >> y;
		x /= 2;
		y /= 2;
		v.push_back(make_pair(x,y));
	}
	sort(v.rbegin(), v.rend());

	int mx = 0, my = 0;
	int lasty = 0;

	long long sol = 0;
	for(int i = 0; i < n; i++){
		if(v[i].first <= mx && v[i].second <= my) continue;
		//cout << "x -> " << v[i].first << " y -> " << v[i].second << " lasty -> " << lasty << "\n";
		sol += v[i].first * (v[i].second - lasty);
		mx = max(mx, v[i].first);
		my = max(my, v[i].second);
		lasty = v[i].second;
	}
	cout << sol * 4;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 464 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 576 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 632 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 648 KB Output is correct
3 Correct 2 ms 692 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 872 KB Output is correct
2 Correct 4 ms 952 KB Output is correct
3 Correct 4 ms 1024 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 403 ms 23820 KB Output is correct
2 Correct 384 ms 38924 KB Output is correct
3 Correct 431 ms 53984 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 53984 KB Output is correct
2 Correct 2 ms 53984 KB Output is correct
3 Correct 2 ms 53984 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 53984 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 53984 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 105 ms 55596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 393 ms 66560 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2 Halted 0 ms 0 KB -