Submission #219384

#TimeUsernameProblemLanguageResultExecution timeMemory
219384ho94949Treatment Project (JOI20_treatment)C++17
35 / 100
3081 ms5344 KiB
#include <bits/stdc++.h> using namespace std; const int MAXM = 1e5; int N, M; int T[MAXM], L[MAXM], R[MAXM], C[MAXM]; int XL[MAXM], YL[MAXM], XR[MAXM], YR[MAXM]; bool vis[MAXM]; int main() { scanf("%d%d", &N, &M); vector<int> x, y; for(int i=0; i<M; ++i) { scanf("%d%d%d%d", T+i, L+i, R+i, C+i); --L[i]; //L[i] = 0, R[i] = N covers whole XL[i] = L[i]-T[i], YL[i] = L[i]+T[i]; XR[i] = R[i]-T[i], YR[i] = R[i]+T[i]; x.push_back(XL[i]); x.push_back(XR[i]); y.push_back(YL[i]); y.push_back(YR[i]); } sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end()); sort(y.begin(), y.end()); y.erase(unique(y.begin(), y.end()), y.end()); for(int i=0; i<M; ++i) { XL[i] = lower_bound(x.begin(), x.end(), XL[i]) - x.begin(); XR[i] = lower_bound(x.begin(), x.end(), XR[i]) - x.begin(); YL[i] = lower_bound(y.begin(), y.end(), YL[i]) - y.begin(); YR[i] = lower_bound(y.begin(), y.end(), YR[i]) - y.begin(); } using pli = pair<long long, int>; priority_queue<pli, vector<pli>, greater<pli>> Q; for(int i=0; i<M; ++i) if(L[i] == 0) vis[i] = true, Q.emplace((long long)C[i], i); while(!Q.empty()) { auto [cost, idx] = Q.top(); Q.pop(); if(R[idx] == N) return printf("%lld\n", cost), 0; for(int i=0; i<M; ++i) { if(vis[i]) continue; if(XL[i] <= XR[idx] && YL[i] <= YR[idx]) { vis[i] = true; Q.emplace(cost+C[i], i); } } } puts("-1"); }

Compilation message (stderr)

treatment.cpp: In function 'int main()':
treatment.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &N, &M);
     ~~~~~^~~~~~~~~~~~~~~~
treatment.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d%d", T+i, L+i, R+i, C+i);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...