oj.uz

Submission #29060

# Submission time Handle Problem Language Result Execution time Memory
29060 2017-07-18T07:53:34 Z 윤교준(#1173) Arranging Tickets (JOI17_arranging_tickets) C++11
65 / 100
 6000 ms 19228 KB 
#include <bits/stdc++.h>
#define pb push_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define revv(V) reverse(allv(V))
#define clv(V) (V).clear()
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define rb(x) ((x)&(-(x)))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
#define MAXN (200005)
#define MAXM (100005)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
struct Node {
	Node(int s, int e, int c) : s(s), e(e), c(c) {}
	int s, e, c;
	bool operator < (const Node& t) const {
		if(e != t.e) return e > t.e;
		if(s != t.s) return s < t.s;
		return c > t.c;
	}
	bool operator > (const Node& t) const { return !operator <(t); }
};

priority_queue<Node, vector<Node>, greater<Node>> PQ;
vector<pii> G[MAXN]; // {e, c}
vector<piii> L, RL;
ll S[MAXN], Q[MAXN], V[MAXN];
int d[MAXN];
int A[MAXM], B[MAXM], C[MAXM];
int N, M;
ll Ans;

bool f(ll m, ll n, int x) {
	while(!PQ.empty()) PQ.pop();
	for(int i = 0; i <= x; i++) clv(G[i]);
	clv(RL);
	for(piii& l : L) {
		int s, e; tie(s, e) = l.first;
		if(x < s || e < x) continue;
		G[s].pb({e, l.second});
	}
	for(int i = 0; i < x; i++) Q[i] = (S[i] + n - m + 1) / 2;
	Q[x] = n;
	ll cnt = 0;
	for(int i = 0; i <= x; i++) {
		for(pii& v : G[i]) PQ.push(Node(i, v.first, v.second));
		while(cnt < Q[i]) {
			if(PQ.empty()) return false;
			Node ret = PQ.top(); PQ.pop();
			if(cnt+ret.c <= Q[i]) {
				RL.pb({{ret.s, ret.e}, ret.c});
				cnt += ret.c;
			} else {
				RL.pb({{ret.s, ret.e}, Q[i] - cnt});
				ll left = ret.c - Q[i] + cnt;
				PQ.push(Node(ret.s, ret.e, left));
				cnt = Q[i];
			}
		}
	}
	fill(V, V+N+1, 0);
	for(piii& l : L) {
		V[l.first.first] += l.second;
		V[l.first.second+1] -= l.second;
	}
	for(piii& l : RL) {
		int s, e, c; tie(s, e) = l.first; c = l.second;
		V[s] -= c; V[e+1] += c;
		if(s) { V[0] += c; V[s] -= c; }
		if(e+1 < N) { V[e+1] += c; V[N] -= c; }
	}
	for(int i = 1; i <= N; i++) V[i] += V[i-1];
	return (*max_element(V, V+N)) <= m;
}
bool f(vector<int>& VX, ll m) {
	for(int x : VX) {
		if(f(m, max(0ll, S[x]-m), x)) return true;
		if(f(m, max(0ll, S[x]-m+1), x)) return true;
	}
	return false;
}
ll getAns() {
	vector<int> VX;
	ll s = 1, e = *max_element(S, S+N);
	for(int i = 0; i < N; i++) if(e == S[i]) VX.pb(i);
	for(ll m; s < e;) {
		m = (s+e)/2;
		if(f(VX, m)) e = m; else s = m+1;
	}
	return s;
}
int main() {
	scanf("%d%d", &N, &M);
	for(int i = 0; i < M; i++) scanf("%d%d%d", &A[i], &B[i], &C[i]);
	for(int i = 0; i < M; i++) { A[i]--; B[i]--; }
	for(int i = 0; i < M; i++) {
		if(A[i] < B[i]) L.pb({{A[i], B[i]-1}, C[i]});
		else L.pb({{B[i], A[i]-1}, C[i]});
	}
	for(piii& l : L) {
		S[l.first.first] += l.second;
		S[l.first.second+1] -= l.second;
	}
	for(int i = 1; i <= N; i++) S[i] += S[i-1];
	printf("%lld\n", getAns());
	return 0;
}

Compilation message

arranging_tickets.cpp: In function 'int main()':
arranging_tickets.cpp:100:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &M);
                       ^
arranging_tickets.cpp:101:65: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 0; i < M; i++) scanf("%d%d%d", &A[i], &B[i], &C[i]);
                                                                 ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 13352 KB Output is correct
2 Correct 0 ms 13352 KB Output is correct
3 Correct 0 ms 13352 KB Output is correct
4 Correct 3 ms 13352 KB Output is correct
5 Correct 3 ms 13352 KB Output is correct
6 Correct 0 ms 13352 KB Output is correct
7 Correct 3 ms 13352 KB Output is correct
8 Correct 0 ms 13352 KB Output is correct
9 Correct 0 ms 13352 KB Output is correct
10 Correct 3 ms 13352 KB Output is correct
11 Correct 0 ms 13352 KB Output is correct
12 Correct 0 ms 13352 KB Output is correct
13 Correct 3 ms 13352 KB Output is correct
14 Correct 0 ms 13352 KB Output is correct
15 Correct 3 ms 13352 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 13352 KB Output is correct
2 Correct 0 ms 13352 KB Output is correct
3 Correct 0 ms 13352 KB Output is correct
4 Correct 3 ms 13352 KB Output is correct
5 Correct 3 ms 13352 KB Output is correct
6 Correct 0 ms 13352 KB Output is correct
7 Correct 3 ms 13352 KB Output is correct
8 Correct 0 ms 13352 KB Output is correct
9 Correct 0 ms 13352 KB Output is correct
10 Correct 3 ms 13352 KB Output is correct
11 Correct 0 ms 13352 KB Output is correct
12 Correct 0 ms 13352 KB Output is correct
13 Correct 3 ms 13352 KB Output is correct
14 Correct 0 ms 13352 KB Output is correct
15 Correct 3 ms 13352 KB Output is correct
16 Correct 3 ms 13352 KB Output is correct
17 Correct 3 ms 13352 KB Output is correct
18 Correct 0 ms 13352 KB Output is correct
19 Correct 0 ms 13352 KB Output is correct
20 Correct 0 ms 13352 KB Output is correct
21 Correct 3 ms 13352 KB Output is correct
22 Correct 0 ms 13352 KB Output is correct
23 Correct 3 ms 13352 KB Output is correct
24 Correct 0 ms 13352 KB Output is correct
25 Correct 3 ms 13352 KB Output is correct
26 Correct 0 ms 13352 KB Output is correct
27 Correct 3 ms 13352 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 13352 KB Output is correct
2 Correct 0 ms 13352 KB Output is correct
3 Correct 0 ms 13352 KB Output is correct
4 Correct 3 ms 13352 KB Output is correct
5 Correct 3 ms 13352 KB Output is correct
6 Correct 0 ms 13352 KB Output is correct
7 Correct 3 ms 13352 KB Output is correct
8 Correct 0 ms 13352 KB Output is correct
9 Correct 0 ms 13352 KB Output is correct
10 Correct 3 ms 13352 KB Output is correct
11 Correct 0 ms 13352 KB Output is correct
12 Correct 0 ms 13352 KB Output is correct
13 Correct 3 ms 13352 KB Output is correct
14 Correct 0 ms 13352 KB Output is correct
15 Correct 3 ms 13352 KB Output is correct
16 Correct 3 ms 13352 KB Output is correct
17 Correct 3 ms 13352 KB Output is correct
18 Correct 0 ms 13352 KB Output is correct
19 Correct 0 ms 13352 KB Output is correct
20 Correct 0 ms 13352 KB Output is correct
21 Correct 3 ms 13352 KB Output is correct
22 Correct 0 ms 13352 KB Output is correct
23 Correct 3 ms 13352 KB Output is correct
24 Correct 0 ms 13352 KB Output is correct
25 Correct 3 ms 13352 KB Output is correct
26 Correct 0 ms 13352 KB Output is correct
27 Correct 3 ms 13352 KB Output is correct
28 Correct 6 ms 13524 KB Output is correct
29 Correct 6 ms 13524 KB Output is correct
30 Correct 3 ms 13524 KB Output is correct
31 Correct 3 ms 13524 KB Output is correct
32 Correct 13 ms 13524 KB Output is correct
33 Correct 99 ms 13524 KB Output is correct
34 Correct 126 ms 13524 KB Output is correct
35 Correct 19 ms 13524 KB Output is correct
36 Correct 109 ms 13524 KB Output is correct
37 Correct 473 ms 13524 KB Output is correct
38 Correct 443 ms 13524 KB Output is correct
39 Correct 633 ms 13524 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 13352 KB Output is correct
2 Correct 0 ms 13352 KB Output is correct
3 Correct 0 ms 13352 KB Output is correct
4 Correct 3 ms 13352 KB Output is correct
5 Correct 3 ms 13352 KB Output is correct
6 Correct 0 ms 13352 KB Output is correct
7 Correct 3 ms 13352 KB Output is correct
8 Correct 0 ms 13352 KB Output is correct
9 Correct 0 ms 13352 KB Output is correct
10 Correct 3 ms 13352 KB Output is correct
11 Correct 0 ms 13352 KB Output is correct
12 Correct 0 ms 13352 KB Output is correct
13 Correct 3 ms 13352 KB Output is correct
14 Correct 0 ms 13352 KB Output is correct
15 Correct 3 ms 13352 KB Output is correct
16 Correct 3 ms 13352 KB Output is correct
17 Correct 3 ms 13352 KB Output is correct
18 Correct 0 ms 13352 KB Output is correct
19 Correct 0 ms 13352 KB Output is correct
20 Correct 0 ms 13352 KB Output is correct
21 Correct 3 ms 13352 KB Output is correct
22 Correct 0 ms 13352 KB Output is correct
23 Correct 3 ms 13352 KB Output is correct
24 Correct 0 ms 13352 KB Output is correct
25 Correct 3 ms 13352 KB Output is correct
26 Correct 0 ms 13352 KB Output is correct
27 Correct 3 ms 13352 KB Output is correct
28 Correct 6 ms 13524 KB Output is correct
29 Correct 6 ms 13524 KB Output is correct
30 Correct 3 ms 13524 KB Output is correct
31 Correct 3 ms 13524 KB Output is correct
32 Correct 13 ms 13524 KB Output is correct
33 Correct 99 ms 13524 KB Output is correct
34 Correct 126 ms 13524 KB Output is correct
35 Correct 19 ms 13524 KB Output is correct
36 Correct 109 ms 13524 KB Output is correct
37 Correct 473 ms 13524 KB Output is correct
38 Correct 443 ms 13524 KB Output is correct
39 Correct 633 ms 13524 KB Output is correct
40 Correct 489 ms 19008 KB Output is correct
41 Correct 569 ms 19228 KB Output is correct
42 Correct 489 ms 19080 KB Output is correct
43 Correct 566 ms 18764 KB Output is correct
44 Correct 419 ms 18892 KB Output is correct
45 Correct 646 ms 18588 KB Output is correct
46 Execution timed out 6000 ms 18792 KB Execution timed out
47 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 13352 KB Output is correct
2 Correct 0 ms 13352 KB Output is correct
3 Correct 0 ms 13352 KB Output is correct
4 Correct 3 ms 13352 KB Output is correct
5 Correct 3 ms 13352 KB Output is correct
6 Correct 0 ms 13352 KB Output is correct
7 Correct 3 ms 13352 KB Output is correct
8 Correct 0 ms 13352 KB Output is correct
9 Correct 0 ms 13352 KB Output is correct
10 Correct 3 ms 13352 KB Output is correct
11 Correct 0 ms 13352 KB Output is correct
12 Correct 0 ms 13352 KB Output is correct
13 Correct 3 ms 13352 KB Output is correct
14 Correct 0 ms 13352 KB Output is correct
15 Correct 3 ms 13352 KB Output is correct
16 Correct 3 ms 13352 KB Output is correct
17 Correct 3 ms 13352 KB Output is correct
18 Correct 0 ms 13352 KB Output is correct
19 Correct 0 ms 13352 KB Output is correct
20 Correct 0 ms 13352 KB Output is correct
21 Correct 3 ms 13352 KB Output is correct
22 Correct 0 ms 13352 KB Output is correct
23 Correct 3 ms 13352 KB Output is correct
24 Correct 0 ms 13352 KB Output is correct
25 Correct 3 ms 13352 KB Output is correct
26 Correct 0 ms 13352 KB Output is correct
27 Correct 3 ms 13352 KB Output is correct
28 Correct 6 ms 13524 KB Output is correct
29 Correct 6 ms 13524 KB Output is correct
30 Correct 3 ms 13524 KB Output is correct
31 Correct 3 ms 13524 KB Output is correct
32 Correct 13 ms 13524 KB Output is correct
33 Correct 99 ms 13524 KB Output is correct
34 Correct 126 ms 13524 KB Output is correct
35 Correct 19 ms 13524 KB Output is correct
36 Correct 109 ms 13524 KB Output is correct
37 Correct 473 ms 13524 KB Output is correct
38 Correct 443 ms 13524 KB Output is correct
39 Correct 633 ms 13524 KB Output is correct
40 Correct 489 ms 19008 KB Output is correct
41 Correct 569 ms 19228 KB Output is correct
42 Correct 489 ms 19080 KB Output is correct
43 Correct 566 ms 18764 KB Output is correct
44 Correct 419 ms 18892 KB Output is correct
45 Correct 646 ms 18588 KB Output is correct
46 Execution timed out 6000 ms 18792 KB Execution timed out
47 Halted 0 ms 0 KB -