oj.uz

Submission #1100102

# Submission time Handle Problem Language Result Execution time Memory
1100102 2024-10-12T17:34:13 Z _8_8_ Treatment Project (JOI20_treatment) C++17
35 / 100
 1411 ms 524288 KB 
#include <bits/stdc++.h>
    
using namespace std;
    
typedef long long ll;
    
const int  N = 2e5 + 12, MOD = (int)1e9 + 7;
    
const ll inf = 1e18;
ll res = inf, d[N];
int n, m;
vector<array<int, 4>> a;
    
bool cmp(array<int, 4> x, array<int, 4> y) {
    return make_pair(x[1], x[2]) < make_pair(y[1], y[2]);
}
vector<int> g[N];
void test() {
    cin >> n >> m;
    a.resize(m);
    for(int i = 0; i < m; i++) {
        cin >> a[i][0] >> a[i][1] >> a[i][2] >> a[i][3], d[i] = inf;
    }
    for(int i = 0; i < m; i++) {
        for(int j = 0; j < m; j++) {
            if(i == j) continue;
            ll inter = a[i][2] - a[j][1] + 1, val = abs(a[i][0] - a[j][0]);
            if(a[j][1] + val <= a[i][2] + 1) {
                g[i].push_back(j);
            }
        }
    }
    set<pair<ll, int>> st;
    for(int i = 0; i < m; i++) {    
        if(a[i][1] == 1) {
            d[i] = 0;
            st.insert({0, i});
        }
    }
    while(!st.empty()) {
        auto [w, v] = (*st.begin());
        st.erase(st.begin());
        for(int to:g[v]) {
            if(d[to] > d[v] + a[v][3]) {
                st.erase({d[to], to});
                d[to] = d[v] + a[v][3];
                st.insert({d[to], to});
            }
        }
    }
    for(int i = 0; i < m; i++) if(a[i][2] == n){
        res = min(res, d[i] + a[i][3]);
    }
    if(res == inf) {
        res = -1;
    }
    cout << res << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); 
    
    int t = 1; 
    // cin >> t;
    
    while(t--) 
        test();
    
    return 0;
}

Compilation message

treatment.cpp: In function 'void test()':
treatment.cpp:27:16: warning: unused variable 'inter' [-Wunused-variable]
   27 |             ll inter = a[i][2] - a[j][1] + 1, val = abs(a[i][0] - a[j][0]);
      |                ^~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Runtime error 1411 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 3 ms 4960 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 2 ms 4960 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 5164 KB Output is correct
17 Correct 2 ms 4928 KB Output is correct
18 Correct 2 ms 4956 KB Output is correct
19 Correct 3 ms 5212 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 3 ms 4960 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 2 ms 4960 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 2 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 4956 KB Output is correct
16 Correct 2 ms 5164 KB Output is correct
17 Correct 2 ms 4928 KB Output is correct
18 Correct 2 ms 4956 KB Output is correct
19 Correct 3 ms 5212 KB Output is correct
20 Correct 188 ms 73052 KB Output is correct
21 Correct 178 ms 72788 KB Output is correct
22 Correct 45 ms 6672 KB Output is correct
23 Correct 50 ms 6744 KB Output is correct
24 Correct 123 ms 55340 KB Output is correct
25 Correct 80 ms 40152 KB Output is correct
26 Correct 81 ms 37964 KB Output is correct
27 Correct 75 ms 45396 KB Output is correct
28 Correct 124 ms 55036 KB Output is correct
29 Correct 77 ms 39912 KB Output is correct
30 Correct 61 ms 43640 KB Output is correct
31 Correct 65 ms 46164 KB Output is correct
32 Correct 189 ms 69392 KB Output is correct
33 Correct 182 ms 106720 KB Output is correct
34 Correct 155 ms 68948 KB Output is correct
35 Correct 184 ms 69460 KB Output is correct
36 Correct 176 ms 106532 KB Output is correct
37 Correct 159 ms 68692 KB Output is correct

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Runtime error 1411 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -