oj.uz

Submission #947046

# Submission time Handle Problem Language Result Execution time Memory
947046 2024-03-15T12:33:49 Z vjudge1 Treatment Project (JOI20_treatment) C++17
35 / 100
 3000 ms 9152 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
 
#define ff first
#define ss second
#define pb push_back
#define int long long
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
 
using namespace std;
 
void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} 
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int N = 1e5 + 1, inf = 1e18;

unordered_map <int, unordered_map<int, int> > dp;

void setmin(int &a, int b){
	a = min(a, b);
}
main(){
	iostream::sync_with_stdio(false);	
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, m;
    cin >> n >> m;
    vector <array <int, 4> > vp;
    set <pair <int,pair <int,int> > > st;
    for(int i = 0; i < m; i++){
		int t, l, r, c;
		cin >> t >> l >> r >> c;
		vp.pb({t, l, r, c});
		if(l == 1){
			if(!dp[r].count(t))
				dp[r][t] = c;
			else
				setmin(dp[r][t], c);
			//cout << dp[r][t] <<" "<< r <<" "<< t << endl;
			st.insert({dp[r][t], {r, t}});
		}
	}
	while(!st.empty()){
		int cost = st.begin() ->ff;
		int f = st.begin() -> ss.ff;
		int s = st.begin() -> ss.ss;
		st.erase(st.begin());
		//cout << cost << endl;
		if(cost != dp[f][s])continue;
		bool flag = 0;
		for(auto &[t, l, r, c] : vp){
			if(t > s){
				if(l + t <= f + s + 1){
					if(!dp[r].count(t) || dp[r][t] > cost + c){
						dp[r][t]= cost + c;
						st.insert({dp[r][t], {r, t}});
						flag = 1;
					}
				}
			}else if(t <= s){
				if(l - t <= f - s  + 1){
					if(!dp[r].count(t) || dp[r][t] > cost + c){
						dp[r][t] = cost + c;
						st.insert({dp[r][t], {r, t}});
						flag = 1;
					}
				} 
			}
		}
		//if(!flag)st.erase(st.begin());
	}
	int ans = inf;
	for(auto x : dp[n]){
		//cout <<"==="<< x.ff <<"-" << x.ss<< endl;
		ans = min(ans, x.ss);
	}
	if(ans == inf)
		cout <<"-1\n";
	else
		cout << ans << endl;
}	
/*
 * Before implementing the problem:
	
	Do I understand the problem correctly?
	Which places are tricky? What do I need to remember to implement them correctly?
	Which place is the heaviest by implementation? Can I do it simpler?
	Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
	----------------------------------
	If not AC:
 
	Did you remember to do everything to handle the tricky places you thought about before?
	Is the solution correct?
	Do I understand the problem correctly?
	----------------------------------
	If you have a test on which the solution gives wrong answer:
 
	Is the solution doing what it was supposed to do?
	Is the problem in the code or in the idea?
*/

Compilation message

treatment.cpp:27:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   27 | main(){
      | ^~~~
treatment.cpp: In function 'int main()':
treatment.cpp:55:8: warning: variable 'flag' set but not used [-Wunused-but-set-variable]
   55 |   bool flag = 0;
      |        ^~~~
treatment.cpp: In function 'void fp(std::string)':
treatment.cpp:15:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
treatment.cpp:15:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3081 ms 9152 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 432 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 356 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 456 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 460 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 432 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 456 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 356 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 456 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 460 KB Output is correct
20 Correct 455 ms 1520 KB Output is correct
21 Correct 448 ms 1092 KB Output is correct
22 Correct 63 ms 1712 KB Output is correct
23 Correct 37 ms 1488 KB Output is correct
24 Correct 554 ms 1788 KB Output is correct
25 Correct 359 ms 2308 KB Output is correct
26 Correct 308 ms 1748 KB Output is correct
27 Correct 383 ms 2280 KB Output is correct
28 Correct 514 ms 1856 KB Output is correct
29 Correct 234 ms 2116 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 3 ms 860 KB Output is correct
32 Correct 789 ms 1840 KB Output is correct
33 Correct 1079 ms 1812 KB Output is correct
34 Correct 616 ms 2152 KB Output is correct
35 Correct 726 ms 1776 KB Output is correct
36 Correct 1034 ms 2008 KB Output is correct
37 Correct 653 ms 1752 KB Output is correct

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3081 ms 9152 KB Time limit exceeded
2 Halted 0 ms 0 KB -