Submission #947019

#	Time	Username	Problem	Language	Result	Execution time	Memory
947019		vjudge1	Treatment Project (JOI20_treatment)	C++17	0 / 100	3050 ms	8396 KiB

treatment

#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;

map <pair <int,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,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.count({r, t}))
				dp[{r, t}] = c;
			else
				setmin(dp[{r, t}], c);
			st.insert({r, t});
		}
	}
	while(!st.empty()){
		int f = st.begin() -> ff;
		int s = st.begin() -> ss;
		//st.erase(st.begin());
		bool flag = 0;
		for(auto &[t, l, r, c] : vp){
			if(r <= f)continue;
			if(t > s){
				if(l + t <= f + s + 1){
					if(!dp.count({r, t}) || dp[{r, t}] > dp[{f, s}] + c){
						dp[{r, t}] = dp[{f, s}] + c;
						st.insert({r, t});
						flag = 1;
					}
				}
			}else if(t <= s){
				if(l - t <= f - s  + 1){
					if(!dp.count({r, t}) || dp[{r, t}] > dp[{f, s}] + c){
						dp[{r, t}] = dp[{f, s}] + c;
						st.insert({r, t});
						flag = 1;
					}
				} 
			}
		}
		if(!flag)st.erase(st.begin());
	}
	int ans = inf;
	for(auto x : dp){
		if(x.ff.ff == n)
			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 (stderr)

treatment.cpp:27:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   27 | main(){
      | ^~~~
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
• Subtask 2: 0 / 5
• Subtask 3: 0 / 30
• Subtask 4: 0 / 61