oj.uz

Submission #423927

# Submission time Handle Problem Language Result Execution time Memory
423927 2021-06-11T14:12:12 Z jamezzz Treatment Project (JOI20_treatment) C++17
0 / 100
 3000 ms 16892 KB 
#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb emplace_back
#define LINF 1023456789123456789
#define all(x) x.begin(),x.end()
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ll,int> li;

#define maxn 200005

int n,m,t[maxn],l[maxn],r[maxn],c[maxn];
ll dist[maxn];
vector<int> d;
vector<ii> AL[maxn];
priority_queue<ii,vector<ii>,greater<ii>> pq;

int main(){
	sf("%d%d",&n,&m);
	d.pb(1);d.pb(n+1);
	for(int i=0;i<m;++i){
		sf("%d%d%d%d",&t[i],&l[i],&r[i],&c[i]);
		d.pb(l[i]);d.pb(r[i]+1);
	}
	sort(all(d));
	d.erase(unique(all(d)),d.end());
	for(int i=0;i<m;++i){
		l[i]=lower_bound(all(d),l[i])-d.begin();
		r[i]=lower_bound(all(d),r[i]+1)-d.begin();
		AL[l[i]].pb(r[i],c[i]);
	}
	n=d.size();
	for(int i=1;i<n;++i){
		dist[i]=LINF;
		AL[i].pb(i-1,0);
	}
	dist[0]=0;
	pq.push(li(0,0));
	while(!pq.empty()){
		ll d;int u;tie(d,u)=pq.top();pq.pop();
		if(d>dist[u])continue;
		for(ii pr:AL[u]){
			if(dist[pr.fi]>dist[u]+pr.se){
				dist[pr.fi]=dist[u]+pr.se;
				pq.push(li(dist[pr.fi],pr.fi));
			}
		}
	}
	if(dist[n-1]==LINF)pf("-1\n");
	else pf("%lld\n",dist[n-1]);
}

/*
10 5
1 5 10 3
1 1 6 5
1 2 8 3
1 6 10 4
1 1 3 1
*/

Compilation message

treatment.cpp: In function 'int main()':
treatment.cpp:24:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |  sf("%d%d",&n,&m);
      |    ^
treatment.cpp:27:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |   sf("%d%d%d%d",&t[i],&l[i],&r[i],&c[i]);
      |     ^

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 11196 KB Output is correct
2 Correct 108 ms 11212 KB Output is correct
3 Correct 85 ms 10080 KB Output is correct
4 Correct 87 ms 10060 KB Output is correct
5 Correct 58 ms 8104 KB Output is correct
6 Correct 58 ms 8356 KB Output is correct
7 Correct 69 ms 8764 KB Output is correct
8 Correct 57 ms 8160 KB Output is correct
9 Correct 62 ms 8368 KB Output is correct
10 Correct 68 ms 9128 KB Output is correct
11 Correct 134 ms 13612 KB Output is correct
12 Correct 133 ms 13892 KB Output is correct
13 Correct 160 ms 16156 KB Output is correct
14 Correct 154 ms 16052 KB Output is correct
15 Execution timed out 3073 ms 16892 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Incorrect 3 ms 4940 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Incorrect 3 ms 4940 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 11196 KB Output is correct
2 Correct 108 ms 11212 KB Output is correct
3 Correct 85 ms 10080 KB Output is correct
4 Correct 87 ms 10060 KB Output is correct
5 Correct 58 ms 8104 KB Output is correct
6 Correct 58 ms 8356 KB Output is correct
7 Correct 69 ms 8764 KB Output is correct
8 Correct 57 ms 8160 KB Output is correct
9 Correct 62 ms 8368 KB Output is correct
10 Correct 68 ms 9128 KB Output is correct
11 Correct 134 ms 13612 KB Output is correct
12 Correct 133 ms 13892 KB Output is correct
13 Correct 160 ms 16156 KB Output is correct
14 Correct 154 ms 16052 KB Output is correct
15 Execution timed out 3073 ms 16892 KB Time limit exceeded
16 Halted 0 ms 0 KB -