oj.uz

답안 #261189

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
261189 2020-08-11T13:44:04 Z amoo_safar 치료 계획 (JOI20_treatment) C++17
35 / 100
 3000 ms 7032 KB 
// Zende bad Shoma nasime faghat !
#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'

using namespace std;

typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;

const ll Mod = 1000000007LL;
const int N = 2e5 + 10;
const ll Inf = 2242545357980376863LL;
const ll Log = 30;

int n, m;
int T[N], L[N], R[N], C[N], mk[N];

ll dis[N];

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for(int i = 1; i <= m; i++) cin >> T[i] >> L[i] >> R[i] >> C[i];
	ll ans = Inf;

	memset(dis, 31, sizeof dis);
	for(int i = 1; i <= m; i++){
		if(L[i] == 1) dis[i] = C[i];
	}

	while(true){
		ll mn = Inf, idx = -1;
		for(int i = 1; i <= m; i++){
			if(mk[i]) continue;
			if(dis[i] < mn){
				mn = dis[i];
				idx = i;
			}
		}
		if(idx == -1) break;
		mk[idx] = 1;
		if(R[idx] == n) ans = min(ans, dis[idx]);
		for(int j = 1; j <= m; j++){
			if(L[j] > R[idx] + 1) continue;
			if(mk[j]) continue;

			if(T[j] <= T[idx]){
				if(L[j] + (T[idx] - T[j]) <= R[idx] + 1)
					dis[j] = min(dis[j], dis[idx] + C[j]);
			}
			if(T[j] > T[idx]){
				if(R[idx] - (T[j] - T[idx]) >= L[j] - 1)
					dis[j] = min(dis[j], dis[idx] + C[j]);
			}
		}
	}
	if(ans >= Inf) return cout << "-1\n", 0;
	cout << ans << '\n';

	return 0;
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3079 ms 7032 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

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

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1920 KB Output is correct
2 Correct 2 ms 2048 KB Output is correct
3 Correct 2 ms 1920 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 2 ms 1920 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 2 ms 1920 KB Output is correct
8 Correct 2 ms 1920 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 2 ms 1920 KB Output is correct
12 Correct 1 ms 1920 KB Output is correct
13 Correct 2 ms 1920 KB Output is correct
14 Correct 2 ms 1920 KB Output is correct
15 Correct 1 ms 1920 KB Output is correct
16 Correct 2 ms 1920 KB Output is correct
17 Correct 2 ms 1920 KB Output is correct
18 Correct 2 ms 1920 KB Output is correct
19 Correct 2 ms 1920 KB Output is correct
20 Correct 181 ms 2296 KB Output is correct
21 Correct 182 ms 2176 KB Output is correct
22 Correct 156 ms 2256 KB Output is correct
23 Correct 111 ms 2260 KB Output is correct
24 Correct 219 ms 2176 KB Output is correct
25 Correct 92 ms 2176 KB Output is correct
26 Correct 64 ms 2176 KB Output is correct
27 Correct 59 ms 2176 KB Output is correct
28 Correct 216 ms 2176 KB Output is correct
29 Correct 80 ms 2176 KB Output is correct
30 Correct 5 ms 2176 KB Output is correct
31 Correct 5 ms 2176 KB Output is correct
32 Correct 280 ms 2176 KB Output is correct
33 Correct 249 ms 2296 KB Output is correct
34 Correct 166 ms 2176 KB Output is correct
35 Correct 280 ms 2236 KB Output is correct
36 Correct 253 ms 2296 KB Output is correct
37 Correct 155 ms 2176 KB Output is correct

Subtask #4
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3079 ms 7032 KB Time limit exceeded
2 Halted 0 ms 0 KB -