oj.uz

Submission #854284

# Submission time Handle Problem Language Result Execution time Memory
854284 2023-09-26T15:34:44 Z denniskim Treatment Project (JOI20_treatment) C++17
35 / 100
 410 ms 355160 KB 
#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
typedef __int128 lll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
#define MAX 9223372036854775807LL
#define MIN -9223372036854775807LL
#define INF 0x3f3f3f3f3f3f3f3f
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << fixed; cout.precision(10);
#define sp << " "
#define en << "\n"
#define compress(v) sort(v.begin(), v.end()), v.erase(unique(v.begin(), v.end()), v.end())

struct gujo
{
	ll T, L, R, C;
};

ll n, m;
gujo a[5010];
vector<pll> vec[5010];
ll dist[5010];

int main(void)
{
	fastio
	
	cin >> n >> m;
	
	for(ll i = 1 ; i <= m ; i++)
		cin >> a[i].T >> a[i].L >> a[i].R >> a[i].C;
	
	for(ll i = 1 ; i <= m ; i++)
	{
		for(ll j = 1 ; j <= m ; j++)
		{
			if(i == j)
				continue;
			
			if(a[i].R - abs(a[i].T - a[j].T) + 1 >= a[j].L)
				vec[i].push_back({j, a[j].C});
		}
	}
	
	for(ll i = 1 ; i <= m ; i++)
		dist[i] = INF;
	
	priority_queue<pll> pq;
	
	for(ll i = 1 ; i <= m ; i++)
	{
		if(a[i].L == 1)
		{
			dist[i] = a[i].C;
			pq.push({0, i});
		}
	}
	
	while(!pq.empty())
	{
		pll qq = pq.top();
		pq.pop();
		
		for(auto &i : vec[qq.se])
		{
			if(dist[i.fi] > dist[qq.se] + i.se)
			{
				dist[i.fi] = dist[qq.se] + i.se;
				pq.push({-dist[i.fi], i.fi});
			}
		}
	}
	
	ll ans = INF;
	
	for(ll i = 1 ; i <= m ; i++)
	{
		if(a[i].R == n)
			ans = min(ans, dist[i]);
	}
	
	if(ans == INF)
		cout << -1;
	else
		cout << ans;
	
	return 0;
}

Subtask #1
0 / 4.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 580 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 580 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 307 ms 246548 KB Output is correct
21 Correct 304 ms 246204 KB Output is correct
22 Correct 37 ms 5968 KB Output is correct
23 Correct 33 ms 5972 KB Output is correct
24 Correct 221 ms 174696 KB Output is correct
25 Correct 145 ms 118016 KB Output is correct
26 Correct 135 ms 112328 KB Output is correct
27 Correct 167 ms 138132 KB Output is correct
28 Correct 205 ms 173392 KB Output is correct
29 Correct 146 ms 116128 KB Output is correct
30 Correct 147 ms 131924 KB Output is correct
31 Correct 154 ms 140880 KB Output is correct
32 Correct 269 ms 226868 KB Output is correct
33 Correct 410 ms 355132 KB Output is correct
34 Correct 259 ms 226584 KB Output is correct
35 Correct 277 ms 227424 KB Output is correct
36 Correct 409 ms 355160 KB Output is correct
37 Correct 262 ms 226208 KB Output is correct

Subtask #4
0 / 61.0

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