oj.uz

답안 #250564

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
250564 2020-07-18T11:05:59 Z mode149256 Candies (JOI18_candies) C++14
100 / 100
 630 ms 22392 KB 
/*input
5
3
5
1
7
6

20
623239331
125587558
908010226
866053126
389255266
859393857
596640443
60521559
11284043
930138174
936349374
810093502
521142682
918991183
743833745
739411636
276010057
577098544
551216812
816623724
*/
#include <bits/stdc++.h>
using namespace std;

namespace my_template {
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}
}
using namespace my_template;

const int MOD = 1000000007;
const ll INF = 1e15;
const int MX = 100101;

using lii = list<pl>::iterator;

struct comp {
	bool operator()(const lii &a, const lii &b) {
		return (*a).x > (*b).x or ((*a).x == (*b).x and (*a).y < (*b).y);
	}
};

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int N;
	cin >> N;
	list<pl> sk;
	set<lii, comp> did;
	for (int i = 0; i < N; ++i)
	{
		ll a; cin >> a;
		sk.push_back({a, i});
		did.insert((--sk.end()));
	}
	// printf("%d\n", (*did.begin()).y);

	ll suma = 0;
	for (int i = 0; i < (N + 1) / 2; ++i)
	{
		auto it = (*did.begin());
		ll val = (*it).x;
		suma += val;
		did.erase(it);

		ll kitas = -val;
		if (it != sk.begin()) {
			auto prv = prev(it);
			kitas += (*prv).x;
			did.erase(prv);
			sk.erase(prv);
		} else {
			kitas += -INF;
		}

		if (next(it) != sk.end()) {
			auto nxt = next(it);
			kitas += (*nxt).x;
			did.erase(nxt);
			sk.erase(nxt);
		} else {
			kitas += -INF;
		}

		(*it).x = kitas;
		did.insert(it);

		printf("%lld\n", suma);
	}

}

/* Look for:
* special cases (n=1?)
* overflow (ll vs int?)
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* array bounds
*/

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 3 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 2 ms 512 KB Output is correct

Subtask #2
92.0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 3 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 524 ms 22264 KB Output is correct
22 Correct 465 ms 22264 KB Output is correct
23 Correct 534 ms 22312 KB Output is correct
24 Correct 198 ms 22232 KB Output is correct
25 Correct 191 ms 22176 KB Output is correct
26 Correct 179 ms 22264 KB Output is correct
27 Correct 193 ms 22204 KB Output is correct
28 Correct 211 ms 22284 KB Output is correct
29 Correct 203 ms 22264 KB Output is correct
30 Correct 202 ms 22264 KB Output is correct
31 Correct 211 ms 22264 KB Output is correct
32 Correct 221 ms 22164 KB Output is correct
33 Correct 371 ms 22264 KB Output is correct
34 Correct 306 ms 22248 KB Output is correct
35 Correct 316 ms 22228 KB Output is correct
36 Correct 467 ms 22264 KB Output is correct
37 Correct 502 ms 22188 KB Output is correct
38 Correct 630 ms 22232 KB Output is correct
39 Correct 188 ms 22264 KB Output is correct
40 Correct 199 ms 22276 KB Output is correct
41 Correct 176 ms 22352 KB Output is correct
42 Correct 228 ms 22264 KB Output is correct
43 Correct 214 ms 22264 KB Output is correct
44 Correct 212 ms 22264 KB Output is correct
45 Correct 235 ms 22264 KB Output is correct
46 Correct 208 ms 22392 KB Output is correct
47 Correct 237 ms 22264 KB Output is correct
48 Correct 331 ms 22264 KB Output is correct
49 Correct 336 ms 22264 KB Output is correct
50 Correct 337 ms 22264 KB Output is correct