oj.uz

답안 #390461

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
390461 2021-04-16T06:11:27 Z parsabahrami 치료 계획 (JOI20_treatment) C++17
0 / 100
 110 ms 15616 KB 
/* There's someone in my head but it's not me */ 
#include <bits/stdc++.h>
 
using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
 
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second

const int N = 2e5 + 10;
ll dp[N]; vector<pii> adj[N]; vector<int> cp; int w[N], l[N], r[N], T[N], M[N], n, m;

int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= m; i++) {
        scanf("%d%d%d%d", &T[i], &l[i], &r[i], &w[i]);
        assert(T[i] < 2);
        r[i]++;
        cp.push_back(r[i]);
        cp.push_back(l[i]);
    }
    cp.push_back(1), cp.push_back(n + 1);
    sort(cp.begin(), cp.end());
    cp.resize(unique(cp.begin(), cp.end()) - cp.begin());
    for (int i = 1; i <= m; i++) {
        l[i] = lower_bound(begin(cp), end(cp), l[i]) - begin(cp);
        r[i] = lower_bound(begin(cp), end(cp), r[i]) - begin(cp);
        adj[r[i]].push_back({l[i], w[i]});
    }
    for (int i = 0; i + 1 < SZ(cp); i++) {
        adj[i].emplace_back(i + 1, 0);
    }
    priority_queue<pair<ll, int>> pq;
    fill(dp, dp + N, 1e18);
    pq.emplace(dp[SZ(cp) - 1] = 0, SZ(cp) - 1);
    while (SZ(pq)) {
        int v = pq.top().S; pq.pop();
        if (M[v]) continue;
        M[v] = 1;
        for (auto u : adj[v]) 
            if (dp[u.F] > dp[v] + u.S) 
                dp[u.F] = dp[v] + u.S, pq.emplace(-dp[u.F], u.F);
    }
    printf("%lld\n", dp[0]);
    return 0;
}

Compilation message

treatment.cpp: In function 'int main()':
treatment.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   17 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
treatment.cpp:19:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   19 |         scanf("%d%d%d%d", &T[i], &l[i], &r[i], &w[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 15616 KB Output is correct
2 Incorrect 109 ms 15424 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 9 ms 9932 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 9 ms 9932 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 15616 KB Output is correct
2 Incorrect 109 ms 15424 KB Output isn't correct
3 Halted 0 ms 0 KB -