oj.uz

답안 #986211

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
986211 2024-05-20T05:39:51 Z GrindMachine Reconstruction Project (JOI22_reconstruction) C++17
70 / 100
 5000 ms 22928 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:
some solutions

*/

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

vector<pll> adj[N];

ll dfs1(ll u, ll p, ll des, ll mn){
    if(u == des){
        return mn;
    }

    ll ans = inf1;

    for(auto [v,id] : adj[u]){
        if(v == p) conts;
        amin(ans,dfs1(v,u,des,min(mn,id)));
    }

    return ans;
}

ll dfs2(ll u, ll p, ll des, ll mx){
    if(u == des){
        return mx;
    }

    ll ans = 0;

    for(auto [v,id] : adj[u]){
        if(v == p) conts;
        amax(ans,dfs2(v,u,des,max(mx,id)));
    }

    return ans;
}

void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    vector<array<ll,3>> edges(m+5);

    rep1(i,m){
        ll u,v,w; cin >> u >> v >> w;
        edges[i] = {w,u,v};
    }

    sort(edges.begin()+1,edges.begin()+m+1);

    vector<ll> lx(m+5,1), rx(m+5,inf1);

    auto rem = [&](ll id){
        auto [w,u,v] = edges[id];
        adj[u].erase(find(all(adj[u]),make_pair(v,id)));
        adj[v].erase(find(all(adj[v]),make_pair(u,id)));
    };

    // find L[i]
    rep1(i,m){
        auto [w,u,v] = edges[i];
        ll j = dfs1(u,-1,v,inf1);
        if(j <= m){
            rem(j);
            lx[i] = (w+edges[j][0])/2+1;
        }
        adj[u].pb({v,i}), adj[v].pb({u,i});
    }

    // find R[i]
    rep1(i,n) adj[i].clear();

    rev(i,m,1){
        auto [w,u,v] = edges[i];
        ll j = dfs2(u,-1,v,0);
        if(j){
            rem(j);
            rx[i] = (w+edges[j][0])>>1;
        }
        adj[u].pb({v,i}), adj[v].pb({u,i});
    }

    ll q; cin >> q;

    while(q--){
        ll x; cin >> x;
        ll ans = 0;

        rep1(i,m){
            if(lx[i] <= x and x <= rx[i]){
                ans += abs(x-edges[i][0]);
            }
        }

        cout << ans << endl;
    }
}

int main()
{
    fastio;

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

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

    return 0;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 592 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 592 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 819 ms 6180 KB Output is correct
21 Correct 310 ms 6172 KB Output is correct
22 Correct 461 ms 6056 KB Output is correct
23 Correct 538 ms 6184 KB Output is correct
24 Correct 614 ms 6188 KB Output is correct
25 Correct 772 ms 5972 KB Output is correct
26 Correct 792 ms 6224 KB Output is correct
27 Correct 800 ms 6184 KB Output is correct
28 Correct 808 ms 6184 KB Output is correct
29 Correct 541 ms 6464 KB Output is correct
30 Correct 802 ms 6416 KB Output is correct
31 Correct 803 ms 6384 KB Output is correct
32 Correct 798 ms 6484 KB Output is correct
33 Correct 797 ms 6252 KB Output is correct
34 Correct 414 ms 8532 KB Output is correct
35 Correct 825 ms 6228 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Execution timed out 5047 ms 7992 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 592 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1330 ms 22396 KB Output is correct
21 Correct 1342 ms 22396 KB Output is correct
22 Correct 1321 ms 22308 KB Output is correct
23 Correct 1351 ms 22552 KB Output is correct
24 Correct 1302 ms 22428 KB Output is correct
25 Correct 1265 ms 22576 KB Output is correct
26 Correct 1309 ms 22604 KB Output is correct
27 Correct 1301 ms 22468 KB Output is correct
28 Correct 1280 ms 22240 KB Output is correct
29 Correct 1326 ms 22612 KB Output is correct
30 Correct 1403 ms 22488 KB Output is correct
31 Correct 1209 ms 22140 KB Output is correct
32 Correct 1173 ms 22928 KB Output is correct
33 Correct 1358 ms 22548 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 592 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 819 ms 6180 KB Output is correct
21 Correct 310 ms 6172 KB Output is correct
22 Correct 461 ms 6056 KB Output is correct
23 Correct 538 ms 6184 KB Output is correct
24 Correct 614 ms 6188 KB Output is correct
25 Correct 772 ms 5972 KB Output is correct
26 Correct 792 ms 6224 KB Output is correct
27 Correct 800 ms 6184 KB Output is correct
28 Correct 808 ms 6184 KB Output is correct
29 Correct 541 ms 6464 KB Output is correct
30 Correct 802 ms 6416 KB Output is correct
31 Correct 803 ms 6384 KB Output is correct
32 Correct 798 ms 6484 KB Output is correct
33 Correct 797 ms 6252 KB Output is correct
34 Correct 414 ms 8532 KB Output is correct
35 Correct 825 ms 6228 KB Output is correct
36 Correct 2389 ms 6468 KB Output is correct
37 Correct 1940 ms 6684 KB Output is correct
38 Correct 2107 ms 6484 KB Output is correct
39 Correct 2193 ms 6608 KB Output is correct
40 Correct 2290 ms 6776 KB Output is correct
41 Correct 2333 ms 6480 KB Output is correct
42 Correct 2417 ms 6412 KB Output is correct
43 Correct 2411 ms 6596 KB Output is correct
44 Correct 2373 ms 6800 KB Output is correct
45 Correct 2146 ms 7096 KB Output is correct
46 Correct 2450 ms 6804 KB Output is correct
47 Correct 2409 ms 6840 KB Output is correct
48 Correct 2596 ms 6888 KB Output is correct
49 Correct 2243 ms 6704 KB Output is correct
50 Correct 1706 ms 9296 KB Output is correct
51 Correct 2388 ms 6912 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 592 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 819 ms 6180 KB Output is correct
21 Correct 310 ms 6172 KB Output is correct
22 Correct 461 ms 6056 KB Output is correct
23 Correct 538 ms 6184 KB Output is correct
24 Correct 614 ms 6188 KB Output is correct
25 Correct 772 ms 5972 KB Output is correct
26 Correct 792 ms 6224 KB Output is correct
27 Correct 800 ms 6184 KB Output is correct
28 Correct 808 ms 6184 KB Output is correct
29 Correct 541 ms 6464 KB Output is correct
30 Correct 802 ms 6416 KB Output is correct
31 Correct 803 ms 6384 KB Output is correct
32 Correct 798 ms 6484 KB Output is correct
33 Correct 797 ms 6252 KB Output is correct
34 Correct 414 ms 8532 KB Output is correct
35 Correct 825 ms 6228 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Execution timed out 5047 ms 7992 KB Time limit exceeded
40 Halted 0 ms 0 KB -