oj.uz

Submission #985963

# Submission time Handle Problem Language Result Execution time Memory
985963 2024-05-19T12:44:37 Z GrindMachine Treatment Project (JOI20_treatment) C++17
35 / 100
 2304 ms 524288 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

refs:
https://codeforces.com/blog/entry/74871?#comment-592237

*/

const int MOD = 1e9 + 7;
const int N = 5e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<ll> adj[N];

void solve(int test_case)
{
    ll m,n; cin >> m >> n;
    vector<array<ll,4>> a(n+5);
    rep1(i,n) rep(j,4) cin >> a[i][j];

    rep1(i,n){
        rep1(j,n){
            if(i == j) conts;
            auto [ti,li,ri,ci] = a[i];
            auto [tj,lj,rj,cj] = a[j];
            if(ti <= tj){
                if(lj <= ri-(tj-ti-1)){
                    adj[i].pb(j);
                }
            }
            else{
                if(ri >= lj+(ti-tj-1)){
                    adj[i].pb(j);
                }
            }
        }
    }

    priority_queue<pll,vector<pll>,greater<pll>> pq;
    rep1(i,n){
        auto [t,l,r,c] = a[i];
        if(l == 1){
            pq.push({c,i});
        }
    }

    vector<bool> vis(n+5);

    while(!pq.empty()){
        auto [cost,u] = pq.top();
        pq.pop();

        if(a[u][2] == m){
            cout << cost << endl;
            return;
        }

        if(vis[u]) conts;
        vis[u] = 1;

        trav(v,adj[u]){
            ll cost2 = cost+a[v][3];
            pq.push({cost2,v});
        }
    }

    cout << -1 << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Runtime error 718 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 0 ms 568 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 572 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 568 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 572 KB Output is correct
20 Correct 2218 ms 196428 KB Output is correct
21 Correct 2229 ms 194972 KB Output is correct
22 Correct 94 ms 3460 KB Output is correct
23 Correct 84 ms 3328 KB Output is correct
24 Correct 123 ms 101872 KB Output is correct
25 Correct 765 ms 73392 KB Output is correct
26 Correct 689 ms 62336 KB Output is correct
27 Correct 777 ms 75748 KB Output is correct
28 Correct 137 ms 102844 KB Output is correct
29 Correct 526 ms 68976 KB Output is correct
30 Correct 62 ms 71308 KB Output is correct
31 Correct 67 ms 76636 KB Output is correct
32 Correct 201 ms 120912 KB Output is correct
33 Correct 221 ms 189868 KB Output is correct
34 Correct 2009 ms 137436 KB Output is correct
35 Correct 200 ms 120916 KB Output is correct
36 Correct 207 ms 188948 KB Output is correct
37 Correct 2304 ms 137032 KB Output is correct

Subtask #4
0 / 61.0

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