oj.uz

Submission #82696

# Submission time Handle Problem Language Result Execution time Memory
82696 2018-11-01T11:16:18 Z heon Unija (COCI17_unija) C++11
60 / 100
 376 ms 17072 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());
	/*
	for(auto x : v){
		cout << x.first << " " << x.second << "\n";
	}
	*/
	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 - my);
		mx = max(mx, v[i].first);
		my = max(my, v[i].second);
		//lasty = v[i].second;
	}
	cout << sol * 4;
}

Compilation message

unija.cpp: In function 'int main()':
unija.cpp:26:6: warning: unused variable 'lasty' [-Wunused-variable]
  int lasty = 0;
      ^~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 360 ms 17072 KB Output is correct
2 Correct 368 ms 17072 KB Output is correct
3 Correct 376 ms 17072 KB Output is correct

Subtask #6
10.0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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