oj.uz

답안 #748975

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
748975 2023-05-27T08:27:42 Z Dan4Life 치료 계획 (JOI20_treatment) C++17
35 / 100
 485 ms 355020 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
const int mxM = (int)5e3+10;
const int LINF = (int)1e18;
using pii = pair<int,int>;

int n, m, ans=LINF;
int dis[mxM], vis[mxM];
vector<pii> adj[mxM], v;
struct Project{ int t, l, r, c; } a[mxM];

int dijkstra(vector<pii> v){
	fill(dis,dis+m,LINF); fill(vis,vis+m,0); 
	for(auto [u,w] : v) dis[u]=w;
	for(int i = 0; i < m; i++){
		int mn = LINF, a = -1;
		for(int j = 0; j < m; j++)
			if(!vis[j] and mn>dis[j]) mn=dis[j],a=j;
		if(a==-1) break; vis[a]=1;
		for(auto [b,w]: adj[a])
			if(dis[a]+w < dis[b]) 
				dis[b]=dis[a]+w;
	}
	int d = LINF;
	for(int i = 0; i < m; i++) 
		if(a[i].r==n) d=min(d,dis[i]);
	return d;
}

int32_t main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> m;
	for(int i = 0; i < m; i++) 
		cin >> a[i].t >> a[i].l >> a[i].r >> a[i].c;
	for(int i = 0; i < m; i++)
		for(int j = 0; j < m; j++)
			if(a[i].r-abs(a[i].t-a[j].t)>=a[j].l-1 and i!=j)
				adj[i].pb({j,a[j].c});
	for(int i = 0; i < m; i++) if(a[i].l==1) v.pb({i,a[i].c});
	ans = dijkstra(v);
	cout << (ans==LINF?-1:ans);
}

Compilation message

treatment.cpp: In function 'long long int dijkstra(std::vector<std::pair<long long int, long long int> >)':
treatment.cpp:21:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   21 |   if(a==-1) break; vis[a]=1;
      |   ^~
treatment.cpp:21:20: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   21 |   if(a==-1) break; vis[a]=1;
      |                    ^~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 1748 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

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

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 452 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 440 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 360 ms 246104 KB Output is correct
21 Correct 377 ms 245924 KB Output is correct
22 Correct 105 ms 5948 KB Output is correct
23 Correct 84 ms 5868 KB Output is correct
24 Correct 291 ms 174600 KB Output is correct
25 Correct 177 ms 117860 KB Output is correct
26 Correct 161 ms 112356 KB Output is correct
27 Correct 189 ms 137996 KB Output is correct
28 Correct 263 ms 173160 KB Output is correct
29 Correct 182 ms 116232 KB Output is correct
30 Correct 156 ms 131872 KB Output is correct
31 Correct 163 ms 140768 KB Output is correct
32 Correct 353 ms 226608 KB Output is correct
33 Correct 455 ms 355020 KB Output is correct
34 Correct 339 ms 226628 KB Output is correct
35 Correct 370 ms 226916 KB Output is correct
36 Correct 485 ms 354928 KB Output is correct
37 Correct 322 ms 226424 KB Output is correct

Subtask #4
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 1748 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -