oj.uz

Submission #296252

# Submission time Handle Problem Language Result Execution time Memory
296252 2020-09-10T12:40:07 Z patrikpavic2 Pinball (JOI14_pinball) C++17
100 / 100
 268 ms 23916 KB 
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef long long ll;
typedef pair < ll, ll > pll;

const int N = 3e5 + 500;
const ll INF = 1e15;
const int OFF = (1 << 19);

int m, n, L[N], R[N], C[N], Q[N];
vector < int > saz;
pll T[2 * OFF], NULA = {INF, INF};

pll mrg(pll A, pll B){
	return {min(A.X, B.X), min(A.Y, B.Y)};
}

void update(int i, pll nw){
	T[OFF + i] = mrg(T[OFF + i], nw);
	for(i = (i + OFF) / 2 ; i ; i /= 2)
		T[i] = mrg(T[2 * i], T[2 * i + 1]);
}

pll query(int i, int a, int b, int lo, int hi){
	if(lo <= a && b <= hi)
		return T[i];
	if(a > hi || b < lo)
		return NULA;
	return mrg(query(2 * i, a, (a + b) / 2,lo, hi), query(2 * i + 1, (a + b) / 2 + 1, b, lo, hi));
}

int main(){
	for(int i = 0;i < 2 * OFF;i++)
		T[i] = NULA;
	scanf("%d%d", &m, &n);
	saz.PB(1); saz.PB(n);
	for(int i = 0;i < m;i++){
		scanf("%d%d%d%d", L + i, R + i, Q + i, C + i);
		saz.PB(L[i]); saz.PB(R[i]); saz.PB(Q[i]);
	}
	sort(saz.begin(), saz.end());
	saz.erase(unique(saz.begin(), saz.end()), saz.end());
	n = (int)saz.size() - 1;
	update(0, {0, INF}); update(n, {INF, 0});
	for(int i = 0;i < m;i++){
		L[i] = lower_bound(saz.begin(), saz.end(), L[i]) - saz.begin();
		R[i] = lower_bound(saz.begin(), saz.end(), R[i]) - saz.begin();
		Q[i] = lower_bound(saz.begin(), saz.end(), Q[i]) - saz.begin();
	}
	ll sol = INF;
	for(int i = 0;i < m;i++){
		pll ja = query(1, 0, OFF - 1, L[i], R[i]);
		sol = min(sol, ja.X + ja.Y + C[i]);
		ja.X += C[i], ja.Y += C[i];
		//printf("%lld %lld\n", ja.X, ja.Y);
		update(Q[i], ja);
	}
	if(sol == INF)
		printf("-1\n");
	else
		printf("%lld\n", sol);
	return 0;
}

Compilation message

pinball.cpp: In function 'int main()':
pinball.cpp:44:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   44 |  scanf("%d%d", &m, &n);
      |  ~~~~~^~~~~~~~~~~~~~~~
pinball.cpp:47:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   47 |   scanf("%d%d%d%d", L + i, R + i, Q + i, C + i);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16768 KB Output is correct
2 Correct 10 ms 16768 KB Output is correct
3 Correct 10 ms 16768 KB Output is correct
4 Correct 13 ms 16708 KB Output is correct
5 Correct 12 ms 16768 KB Output is correct
6 Correct 10 ms 16744 KB Output is correct
7 Correct 10 ms 16788 KB Output is correct
8 Correct 10 ms 16768 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16768 KB Output is correct
2 Correct 10 ms 16768 KB Output is correct
3 Correct 10 ms 16768 KB Output is correct
4 Correct 13 ms 16708 KB Output is correct
5 Correct 12 ms 16768 KB Output is correct
6 Correct 10 ms 16744 KB Output is correct
7 Correct 10 ms 16788 KB Output is correct
8 Correct 10 ms 16768 KB Output is correct
9 Correct 12 ms 16768 KB Output is correct
10 Correct 11 ms 16768 KB Output is correct
11 Correct 10 ms 16768 KB Output is correct
12 Correct 11 ms 16768 KB Output is correct
13 Correct 11 ms 16744 KB Output is correct
14 Correct 11 ms 16768 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16768 KB Output is correct
2 Correct 10 ms 16768 KB Output is correct
3 Correct 10 ms 16768 KB Output is correct
4 Correct 13 ms 16708 KB Output is correct
5 Correct 12 ms 16768 KB Output is correct
6 Correct 10 ms 16744 KB Output is correct
7 Correct 10 ms 16788 KB Output is correct
8 Correct 10 ms 16768 KB Output is correct
9 Correct 12 ms 16768 KB Output is correct
10 Correct 11 ms 16768 KB Output is correct
11 Correct 10 ms 16768 KB Output is correct
12 Correct 11 ms 16768 KB Output is correct
13 Correct 11 ms 16744 KB Output is correct
14 Correct 11 ms 16768 KB Output is correct
15 Correct 10 ms 16768 KB Output is correct
16 Correct 11 ms 16768 KB Output is correct
17 Correct 13 ms 16768 KB Output is correct
18 Correct 11 ms 16768 KB Output is correct
19 Correct 13 ms 16768 KB Output is correct
20 Correct 12 ms 16768 KB Output is correct
21 Correct 11 ms 16744 KB Output is correct
22 Correct 12 ms 16844 KB Output is correct
23 Correct 11 ms 16768 KB Output is correct
24 Correct 12 ms 16768 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16768 KB Output is correct
2 Correct 10 ms 16768 KB Output is correct
3 Correct 10 ms 16768 KB Output is correct
4 Correct 13 ms 16708 KB Output is correct
5 Correct 12 ms 16768 KB Output is correct
6 Correct 10 ms 16744 KB Output is correct
7 Correct 10 ms 16788 KB Output is correct
8 Correct 10 ms 16768 KB Output is correct
9 Correct 12 ms 16768 KB Output is correct
10 Correct 11 ms 16768 KB Output is correct
11 Correct 10 ms 16768 KB Output is correct
12 Correct 11 ms 16768 KB Output is correct
13 Correct 11 ms 16744 KB Output is correct
14 Correct 11 ms 16768 KB Output is correct
15 Correct 10 ms 16768 KB Output is correct
16 Correct 11 ms 16768 KB Output is correct
17 Correct 13 ms 16768 KB Output is correct
18 Correct 11 ms 16768 KB Output is correct
19 Correct 13 ms 16768 KB Output is correct
20 Correct 12 ms 16768 KB Output is correct
21 Correct 11 ms 16744 KB Output is correct
22 Correct 12 ms 16844 KB Output is correct
23 Correct 11 ms 16768 KB Output is correct
24 Correct 12 ms 16768 KB Output is correct
25 Correct 33 ms 17408 KB Output is correct
26 Correct 72 ms 18548 KB Output is correct
27 Correct 159 ms 21312 KB Output is correct
28 Correct 164 ms 23788 KB Output is correct
29 Correct 113 ms 20464 KB Output is correct
30 Correct 186 ms 23916 KB Output is correct
31 Correct 237 ms 23916 KB Output is correct
32 Correct 268 ms 23916 KB Output is correct
33 Correct 42 ms 18036 KB Output is correct
34 Correct 114 ms 20464 KB Output is correct
35 Correct 157 ms 23912 KB Output is correct
36 Correct 256 ms 23892 KB Output is correct
37 Correct 227 ms 23916 KB Output is correct
38 Correct 226 ms 23864 KB Output is correct