Submission #1090015

#TimeUsernameProblemLanguageResultExecution timeMemory
1090015phongTreatment Project (JOI20_treatment)C++17
0 / 100
1 ms604 KiB
#include<bits/stdc++.h> #define ll long long #define int long long const int nmax = 1e3 + 5, M = 3e6 + 5; const ll oo = 1e18 + 5, base = 311; const int lg = 62, tx = 26; const ll mod = 1e9 + 7, mod2 = 1e9+3; #define pii pair<ll, ll> #define fi first #define se second #define endl "\n" #define debug(a, n) for(int i = 1; i <= n; ++i) cout << a[i] << ' '; cout << "\n"; #define NAME code using namespace std; int n, m; struct node{ int t, l, r, c; }a[nmax]; ll dp[nmax]; main(){ ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); // freopen("code.inp", "r", stdin); // freopen("code.out", "w", stdout); cin >> n >> m; for(int i = 1; i <= m; ++i) cin >> a[i].t >> a[i].l >> a[i].r >> a[i].c; for(int i = 1; i <= m; ++i) dp[i] = oo; priority_queue<pii, vector<pii>, greater<pii>> q; for(int i = 1; i <= m; ++i){ if(a[i].l == 1){ dp[i] = a[i].c; q.push({dp[i], i}); } } while(q.size()){ pii tmp = q.top();q.pop(); int u = tmp.se; for(int i = 1; i <= n; ++i){ if(a[u].r - a[i].l + 1 >= abs(a[u].t - a[i].t)){ if(dp[i] > dp[u] + a[i].c){ dp[i] = dp[u] + a[i].c; q.push({dp[i], i}); } } } } ll ans = oo; for(int i = 1; i <= m; ++i) if(a[i].r == n) ans = min(ans, dp[i]); cout << ans; } /* 10 5 1 1 3 1 1 1 6 5 1 4 8 3 1 5 10 4 1 6 10 3 */

Compilation message (stderr)

treatment.cpp:21:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   21 | main(){
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...