제출 #219379

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
219379		ho94949	치료 계획 (JOI20_treatment)	C++17	35 / 100	3089 ms	3576 KiB

treatment

#include <bits/stdc++.h>
using namespace std;
const int MAXM = 1e5;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
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);
    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];
    }
    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");
}

컴파일 시 표준 에러 (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:14: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);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 4
• Subtask 2: 5 / 5
• Subtask 3: 30 / 30
• Subtask 4: 0 / 61