oj.uz

답안 #217731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
217731 2020-03-30T14:36:46 Z _7_7_ 치료 계획 (JOI20_treatment) C++14
39 / 100
 3000 ms 270444 KB 
#include <bits/stdc++.h>                                           
 
#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef unsigned long long ull;
typedef pair < int, int > pii;
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 1e5 + 11;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 333;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;


vi xx, toDel;
int n, m, d[N], x[N];
set < pii > q, T[N << 2][2];


struct project {
	int t, l, r, c;
} a[N];

void add (int pos, int lvl, pii x, int v = 1, int tl = 0, int tr = m - 1) {
	T[v][lvl].insert(x);
	if (tl == tr)
		return;

	int tm = (tl + tr) >> 1;
	if (pos <= tm)
		add(pos, lvl, x, v << 1, tl, tm);
	else
		add(pos, lvl, x, v << 1 | 1, tm + 1, tr);
}

void del (int pos, int lvl, pii x, int v = 1, int tl = 0, int tr = m - 1) {
	T[v][lvl].erase(x);
	if (tl == tr)
		return;
	
	int tm = (tl + tr) >> 1;
	if (pos <= tm)
		del(pos, lvl, x, v << 1, tl, tm);
	else
		del(pos, lvl, x, v << 1 | 1, tm + 1, tr);
}

void f (int l, int r, int lvl, int X, int Y, int v = 1, int tl = 0, int tr = m - 1) {
	if (l > r || l > tr || tl > r)
		return;

	if (l <= tl && tr <= r) {		
		auto it = T[v][lvl].begin();            
		while (it != T[v][lvl].end()  && it->f <= X) {
			toDel.pb(it->s);
			++it;
		}

		while (sz(toDel))    {
		    int i = toDel.back();
		    toDel.ppb();
		    
			d[i] = Y + a[i].c;
			q.insert({d[i], i});
			del(x[i], 0, {a[i].l + a[i].t, i});
			del(x[i], 1, {a[i].l - a[i].t, i});
		}
		return;
	}

	int tm = (tl + tr) >> 1;
	f(l, r, lvl, X, Y, v << 1, tl, tm);
	f(l, r, lvl, X, Y, v << 1 | 1, tm + 1, tr);
}
	


main () {
    memset(d, -1, sizeof(d));
	cin >> n >> m;
	for (int i = 1; i <= m; ++i) {
		cin >> a[i].t >> a[i].l >> a[i].r >> a[i].c; 
		++a[i].r;
		xx.pb(a[i].t);
	}
	
	sort(all(xx));
	xx.resize(unique(all(xx)) - xx.begin());
	
    for (int i = 1; i <= m; ++i) {
        x[i] = lower_bound(all(xx), a[i].t) - xx.begin();
        if (a[i].l == 1) {
            d[i] = a[i].c;
            q.insert({d[i], i});
        } else {
            add(x[i], 0, {a[i].l + a[i].t, i});
            add(x[i], 1, {a[i].l - a[i].t, i});
        }        
    }


	while (sz(q)) {
		int v = q.begin()->s;
		q.erase(q.begin());
		
		f(x[v], m - 1, 0, a[v].r + a[v].t, d[v]);
		f(0, x[v], 1, a[v].r - a[v].t, d[v]);
	}
	
		
	int mn = INF;	
	for (int i = 1; i <= m; ++i)
		if (a[i].r == n + 1 && d[i] > -1)
			mn = min(mn, d[i]);

	if (mn == INF)
		mn = -1;
	cout << mn << endl;
}

Compilation message

treatment.cpp:102:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1349 ms 268904 KB Output is correct
2 Correct 1423 ms 268788 KB Output is correct
3 Correct 1141 ms 214636 KB Output is correct
4 Correct 1239 ms 214504 KB Output is correct
5 Correct 1350 ms 266728 KB Output is correct
6 Correct 1318 ms 268652 KB Output is correct
7 Correct 1223 ms 268980 KB Output is correct
8 Correct 1378 ms 266728 KB Output is correct
9 Correct 1356 ms 268676 KB Output is correct
10 Correct 1306 ms 268864 KB Output is correct
11 Correct 1500 ms 270440 KB Output is correct
12 Correct 1474 ms 269548 KB Output is correct
13 Correct 1448 ms 269036 KB Output is correct
14 Correct 1498 ms 268788 KB Output is correct
15 Correct 1403 ms 268904 KB Output is correct
16 Correct 1388 ms 268776 KB Output is correct
17 Correct 1351 ms 268904 KB Output is correct
18 Correct 1432 ms 270444 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 38656 KB Output is correct
2 Correct 27 ms 38784 KB Output is correct
3 Correct 26 ms 38656 KB Output is correct
4 Correct 27 ms 38656 KB Output is correct
5 Correct 25 ms 38656 KB Output is correct
6 Correct 25 ms 38656 KB Output is correct
7 Correct 27 ms 38656 KB Output is correct
8 Correct 25 ms 38656 KB Output is correct
9 Correct 25 ms 38656 KB Output is correct
10 Correct 25 ms 38784 KB Output is correct
11 Correct 25 ms 38656 KB Output is correct
12 Correct 27 ms 38656 KB Output is correct
13 Correct 26 ms 38656 KB Output is correct
14 Correct 27 ms 38656 KB Output is correct
15 Correct 28 ms 38656 KB Output is correct
16 Correct 25 ms 38784 KB Output is correct
17 Correct 27 ms 38784 KB Output is correct
18 Correct 26 ms 38656 KB Output is correct
19 Correct 25 ms 38656 KB Output is correct
20 Correct 66 ms 45304 KB Output is correct
21 Correct 76 ms 45304 KB Output is correct
22 Correct 83 ms 47224 KB Output is correct
23 Correct 86 ms 47224 KB Output is correct
24 Correct 79 ms 45944 KB Output is correct
25 Correct 82 ms 47096 KB Output is correct
26 Correct 88 ms 47224 KB Output is correct
27 Correct 82 ms 47480 KB Output is correct
28 Correct 81 ms 45944 KB Output is correct
29 Correct 84 ms 47072 KB Output is correct
30 Correct 84 ms 47228 KB Output is correct
31 Correct 75 ms 47224 KB Output is correct
32 Correct 91 ms 47352 KB Output is correct
33 Correct 90 ms 47228 KB Output is correct
34 Correct 90 ms 47328 KB Output is correct
35 Correct 89 ms 47224 KB Output is correct
36 Correct 93 ms 47480 KB Output is correct
37 Correct 85 ms 47352 KB Output is correct

Subtask #4
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1349 ms 268904 KB Output is correct
2 Correct 1423 ms 268788 KB Output is correct
3 Correct 1141 ms 214636 KB Output is correct
4 Correct 1239 ms 214504 KB Output is correct
5 Correct 1350 ms 266728 KB Output is correct
6 Correct 1318 ms 268652 KB Output is correct
7 Correct 1223 ms 268980 KB Output is correct
8 Correct 1378 ms 266728 KB Output is correct
9 Correct 1356 ms 268676 KB Output is correct
10 Correct 1306 ms 268864 KB Output is correct
11 Correct 1500 ms 270440 KB Output is correct
12 Correct 1474 ms 269548 KB Output is correct
13 Correct 1448 ms 269036 KB Output is correct
14 Correct 1498 ms 268788 KB Output is correct
15 Correct 1403 ms 268904 KB Output is correct
16 Correct 1388 ms 268776 KB Output is correct
17 Correct 1351 ms 268904 KB Output is correct
18 Correct 1432 ms 270444 KB Output is correct
19 Correct 27 ms 38656 KB Output is correct
20 Correct 27 ms 38784 KB Output is correct
21 Correct 26 ms 38656 KB Output is correct
22 Correct 27 ms 38656 KB Output is correct
23 Correct 25 ms 38656 KB Output is correct
24 Correct 25 ms 38656 KB Output is correct
25 Correct 27 ms 38656 KB Output is correct
26 Correct 25 ms 38656 KB Output is correct
27 Correct 25 ms 38656 KB Output is correct
28 Correct 25 ms 38784 KB Output is correct
29 Correct 25 ms 38656 KB Output is correct
30 Correct 27 ms 38656 KB Output is correct
31 Correct 26 ms 38656 KB Output is correct
32 Correct 27 ms 38656 KB Output is correct
33 Correct 28 ms 38656 KB Output is correct
34 Correct 25 ms 38784 KB Output is correct
35 Correct 27 ms 38784 KB Output is correct
36 Correct 26 ms 38656 KB Output is correct
37 Correct 25 ms 38656 KB Output is correct
38 Correct 66 ms 45304 KB Output is correct
39 Correct 76 ms 45304 KB Output is correct
40 Correct 83 ms 47224 KB Output is correct
41 Correct 86 ms 47224 KB Output is correct
42 Correct 79 ms 45944 KB Output is correct
43 Correct 82 ms 47096 KB Output is correct
44 Correct 88 ms 47224 KB Output is correct
45 Correct 82 ms 47480 KB Output is correct
46 Correct 81 ms 45944 KB Output is correct
47 Correct 84 ms 47072 KB Output is correct
48 Correct 84 ms 47228 KB Output is correct
49 Correct 75 ms 47224 KB Output is correct
50 Correct 91 ms 47352 KB Output is correct
51 Correct 90 ms 47228 KB Output is correct
52 Correct 90 ms 47328 KB Output is correct
53 Correct 89 ms 47224 KB Output is correct
54 Correct 93 ms 47480 KB Output is correct
55 Correct 85 ms 47352 KB Output is correct
56 Correct 1930 ms 211544 KB Output is correct
57 Correct 1901 ms 211384 KB Output is correct
58 Correct 2109 ms 264120 KB Output is correct
59 Correct 2069 ms 264012 KB Output is correct
60 Correct 2402 ms 265312 KB Output is correct
61 Correct 2044 ms 264204 KB Output is correct
62 Correct 1870 ms 211444 KB Output is correct
63 Correct 1820 ms 264828 KB Output is correct
64 Correct 1819 ms 265024 KB Output is correct
65 Correct 1499 ms 268988 KB Output is correct
66 Correct 2331 ms 264980 KB Output is correct
67 Correct 2743 ms 262924 KB Output is correct
68 Correct 2271 ms 264880 KB Output is correct
69 Correct 1957 ms 265056 KB Output is correct
70 Correct 2996 ms 263400 KB Output is correct
71 Correct 2553 ms 264820 KB Output is correct
72 Correct 2005 ms 264936 KB Output is correct
73 Execution timed out 3112 ms 263248 KB Time limit exceeded
74 Halted 0 ms 0 KB -