oj.uz

Submission #748962

# Submission time Handle Problem Language Result Execution time Memory
748962 2023-05-27T08:19:57 Z Dan4Life Treatment Project (JOI20_treatment) C++17
5 / 100
 3000 ms 245844 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];
struct Project{ int t, l, r, c; } a[mxM];

int dijkstra(int s){
	fill(dis,dis+m,LINF); fill(vis,vis+m,0); dis[s]=0;
	for(int i = 0; i < n; 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) ans = min(ans, a[i].c+dijkstra(i));
	cout << (ans==LINF?-1:ans);
}

Compilation message

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

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 1364 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 444 KB Output is correct
3 Correct 1 ms 340 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 340 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 452 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
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 444 KB Output is correct
3 Correct 1 ms 340 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 340 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 452 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 Execution timed out 3070 ms 245844 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 1364 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -