oj.uz

Submission #88872

# Submission time Handle Problem Language Result Execution time Memory
88872 2018-12-09T16:59:22 Z jasony123123 Unija (COCI17_unija) C++11
100 / 100
 517 ms 58148 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
inline void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */
#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/**************************COCI 2016-2017 R5 P3 *************************/

int N;
pii rect[1000000]; // <width, height>

int main() {
	io();
	cin >> N;
	FOR(i, 0, N) {
		cin >> rect[i].first >> rect[i].second;
		rect[i].first >>= 1;
		rect[i].second >>= 1;
	}
	sort(rect, rect + N);
	reverse(rect, rect + N);
	int maxh = 0;
	ll ans = 0;
	int i = 0;
	while (i < N) {
		int w = rect[i].first;
		int h = rect[i].second;
		ans += max(0LL, (ll)w*((ll)h - (ll)maxh));
		maxx(maxh, h);
		while (i < N && rect[i].first == w)
			i++;
	}
	ans <<= 2LL;
	cout << ans << "\n";
	return 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 464 KB Output is correct
3 Correct 2 ms 536 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 668 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 3 ms 780 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 387 ms 23556 KB Output is correct
2 Correct 517 ms 27956 KB Output is correct
3 Correct 381 ms 28036 KB Output is correct

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 28036 KB Output is correct
2 Correct 35 ms 28036 KB Output is correct
3 Correct 36 ms 28036 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 28036 KB Output is correct
2 Correct 98 ms 28036 KB Output is correct
3 Correct 99 ms 28036 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 384 ms 28132 KB Output is correct
2 Correct 363 ms 43000 KB Output is correct
3 Correct 389 ms 58148 KB Output is correct