oj.uz

Submission #907732

# Submission time Handle Problem Language Result Execution time Memory
907732 2024-01-16T03:17:27 Z bachhoangxuan Wild Boar (JOI18_wild_boar) C++17
100 / 100
 4392 ms 382684 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define ll long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const ll inf=1e18;
const int mod=998244353;
const int maxn=2005;
const int bl=650;
const int maxs=655;
const int maxL=100005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
const int base=131;

const int sz=5;

struct path{
    int a,b;
    ll d;
    path(ll d=0,int a=0,int b=0):d(d),a(a),b(b){}
    friend bool operator<(path x,path y){return x.d<y.d;}
    friend bool operator>(path x,path y){return x.d>y.d;}
};
struct dist{
    vector<path> p;
    dist(){}
    bool add(path x){
        if((int)p.size()>=sz) return false;
        int c1=0,c2=0;
        for(int i=0;i<(int)p.size();i++){
            if(x.a==p[i].a && x.b==p[i].b) return false;
            c1+=(x.a==p[i].a);
            c2+=(x.b==p[i].b);
        }
        if(c1<2 && c2<2){
            p.push_back(x);
            return true;
        }
        return false;
    }
    friend dist operator+(dist a,dist b){
        dist res;
        vector<path> cc;
        for(auto x:a.p) for(auto y:b.p) if(x.b!=y.a) cc.push_back(path(x.d+y.d,x.a,y.b));
        sort(cc.begin(),cc.end());
        for(auto x:cc) res.add(x);
        return res;
    }
}d[maxn][maxn],tree[4*maxL];

int n,m,T,L,X[maxL];
vector<pii> edge[maxn];

void dijisktra(int s){
    priority_queue<pair<path,int>,vector<pair<path,int>>,greater<pair<path,int>>> pq;
    for(auto &[v,w]:edge[s]) pq.push({path(w,v,s),v});
    while(!pq.empty()){
        path x=pq.top().fi;
        int u=pq.top().se;pq.pop();
        if(!d[s][u].add(x)) continue;
        for(auto [v,w]:edge[u]) if(v!=x.b) pq.push({path(x.d+w,x.a,u),v});
    }
}

void build(int l,int r,int id){
    if(l==r){
        tree[id]=d[X[l]][X[l+1]];
        return;
    }
    int mid=(l+r)>>1;
    build(l,mid,id<<1);build(mid+1,r,id<<1|1);
    tree[id]=tree[id<<1]+tree[id<<1|1];
}
void update(int l,int r,int id,int p){
    if(l==r){
        tree[id]=d[X[l]][X[l+1]];
        return;
    }
    int mid=(l+r)>>1;
    if(p<=mid) update(l,mid,id<<1,p);
    else update(mid+1,r,id<<1|1,p);
    tree[id]=tree[id<<1]+tree[id<<1|1];
}

void solve(){
    cin >> n >> m >> T >> L;
    for(int i=1;i<=m;i++){
        int u,v,w;cin >> u >> v >> w;
        edge[u].push_back({v,w});
        edge[v].push_back({u,w});
    }
    for(int i=1;i<=n;i++) dijisktra(i);
    for(int i=1;i<=L;i++) cin >> X[i];
    build(1,L-1,1);
    for(int i=1;i<=T;i++){
        int p;cin >> p >> X[p];
        if(p>1) update(1,L-1,1,p-1);
        if(p<L) update(1,L-1,1,p);
        cout << (tree[1].p.empty()?-1:tree[1].p[0].d) << '\n';
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Compilation message

wild_boar.cpp: In constructor 'path::path(long long int, int, int)':
wild_boar.cpp:48:8: warning: 'path::d' will be initialized after [-Wreorder]
   48 |     ll d;
      |        ^
wild_boar.cpp:47:9: warning:   'int path::a' [-Wreorder]
   47 |     int a,b;
      |         ^
wild_boar.cpp:49:5: warning:   when initialized here [-Wreorder]
   49 |     path(ll d=0,int a=0,int b=0):d(d),a(a),b(b){}
      |     ^~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 104540 KB Output is correct
2 Correct 32 ms 104532 KB Output is correct
3 Correct 35 ms 104540 KB Output is correct
4 Correct 36 ms 104576 KB Output is correct
5 Correct 32 ms 104528 KB Output is correct
6 Correct 33 ms 104528 KB Output is correct
7 Correct 32 ms 104536 KB Output is correct
8 Correct 33 ms 104532 KB Output is correct
9 Correct 32 ms 104464 KB Output is correct
10 Correct 33 ms 104492 KB Output is correct
11 Correct 32 ms 104536 KB Output is correct
12 Correct 34 ms 104540 KB Output is correct
13 Correct 31 ms 104536 KB Output is correct
14 Correct 32 ms 104532 KB Output is correct
15 Correct 32 ms 104544 KB Output is correct
16 Correct 31 ms 104536 KB Output is correct
17 Correct 31 ms 104536 KB Output is correct
18 Correct 32 ms 104728 KB Output is correct
19 Correct 32 ms 104540 KB Output is correct
20 Correct 33 ms 104532 KB Output is correct
21 Correct 32 ms 104540 KB Output is correct
22 Correct 33 ms 104528 KB Output is correct
23 Correct 32 ms 104540 KB Output is correct
24 Correct 32 ms 104564 KB Output is correct
25 Correct 31 ms 104536 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 104540 KB Output is correct
2 Correct 32 ms 104532 KB Output is correct
3 Correct 35 ms 104540 KB Output is correct
4 Correct 36 ms 104576 KB Output is correct
5 Correct 32 ms 104528 KB Output is correct
6 Correct 33 ms 104528 KB Output is correct
7 Correct 32 ms 104536 KB Output is correct
8 Correct 33 ms 104532 KB Output is correct
9 Correct 32 ms 104464 KB Output is correct
10 Correct 33 ms 104492 KB Output is correct
11 Correct 32 ms 104536 KB Output is correct
12 Correct 34 ms 104540 KB Output is correct
13 Correct 31 ms 104536 KB Output is correct
14 Correct 32 ms 104532 KB Output is correct
15 Correct 32 ms 104544 KB Output is correct
16 Correct 31 ms 104536 KB Output is correct
17 Correct 31 ms 104536 KB Output is correct
18 Correct 32 ms 104728 KB Output is correct
19 Correct 32 ms 104540 KB Output is correct
20 Correct 33 ms 104532 KB Output is correct
21 Correct 32 ms 104540 KB Output is correct
22 Correct 33 ms 104528 KB Output is correct
23 Correct 32 ms 104540 KB Output is correct
24 Correct 32 ms 104564 KB Output is correct
25 Correct 31 ms 104536 KB Output is correct
26 Correct 34 ms 104424 KB Output is correct
27 Correct 48 ms 109444 KB Output is correct
28 Correct 47 ms 108920 KB Output is correct
29 Correct 175 ms 127572 KB Output is correct
30 Correct 180 ms 127864 KB Output is correct
31 Correct 162 ms 128836 KB Output is correct
32 Correct 163 ms 129144 KB Output is correct
33 Correct 179 ms 126548 KB Output is correct
34 Correct 183 ms 127048 KB Output is correct
35 Correct 163 ms 130428 KB Output is correct
36 Correct 171 ms 129360 KB Output is correct
37 Correct 188 ms 127564 KB Output is correct
38 Correct 161 ms 125528 KB Output is correct
39 Correct 175 ms 130892 KB Output is correct
40 Correct 170 ms 125772 KB Output is correct
41 Correct 171 ms 125468 KB Output is correct
42 Correct 163 ms 132432 KB Output is correct
43 Correct 162 ms 126036 KB Output is correct
44 Correct 164 ms 126084 KB Output is correct
45 Correct 100 ms 118540 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 104540 KB Output is correct
2 Correct 32 ms 104532 KB Output is correct
3 Correct 35 ms 104540 KB Output is correct
4 Correct 36 ms 104576 KB Output is correct
5 Correct 32 ms 104528 KB Output is correct
6 Correct 33 ms 104528 KB Output is correct
7 Correct 32 ms 104536 KB Output is correct
8 Correct 33 ms 104532 KB Output is correct
9 Correct 32 ms 104464 KB Output is correct
10 Correct 33 ms 104492 KB Output is correct
11 Correct 32 ms 104536 KB Output is correct
12 Correct 34 ms 104540 KB Output is correct
13 Correct 31 ms 104536 KB Output is correct
14 Correct 32 ms 104532 KB Output is correct
15 Correct 32 ms 104544 KB Output is correct
16 Correct 31 ms 104536 KB Output is correct
17 Correct 31 ms 104536 KB Output is correct
18 Correct 32 ms 104728 KB Output is correct
19 Correct 32 ms 104540 KB Output is correct
20 Correct 33 ms 104532 KB Output is correct
21 Correct 32 ms 104540 KB Output is correct
22 Correct 33 ms 104528 KB Output is correct
23 Correct 32 ms 104540 KB Output is correct
24 Correct 32 ms 104564 KB Output is correct
25 Correct 31 ms 104536 KB Output is correct
26 Correct 34 ms 104424 KB Output is correct
27 Correct 48 ms 109444 KB Output is correct
28 Correct 47 ms 108920 KB Output is correct
29 Correct 175 ms 127572 KB Output is correct
30 Correct 180 ms 127864 KB Output is correct
31 Correct 162 ms 128836 KB Output is correct
32 Correct 163 ms 129144 KB Output is correct
33 Correct 179 ms 126548 KB Output is correct
34 Correct 183 ms 127048 KB Output is correct
35 Correct 163 ms 130428 KB Output is correct
36 Correct 171 ms 129360 KB Output is correct
37 Correct 188 ms 127564 KB Output is correct
38 Correct 161 ms 125528 KB Output is correct
39 Correct 175 ms 130892 KB Output is correct
40 Correct 170 ms 125772 KB Output is correct
41 Correct 171 ms 125468 KB Output is correct
42 Correct 163 ms 132432 KB Output is correct
43 Correct 162 ms 126036 KB Output is correct
44 Correct 164 ms 126084 KB Output is correct
45 Correct 100 ms 118540 KB Output is correct
46 Correct 140 ms 109744 KB Output is correct
47 Correct 1426 ms 161832 KB Output is correct
48 Correct 1897 ms 194308 KB Output is correct
49 Correct 2179 ms 220552 KB Output is correct
50 Correct 2172 ms 220744 KB Output is correct
51 Correct 2144 ms 221908 KB Output is correct
52 Correct 2466 ms 249604 KB Output is correct
53 Correct 2410 ms 250240 KB Output is correct
54 Correct 2409 ms 248976 KB Output is correct
55 Correct 2411 ms 247720 KB Output is correct
56 Correct 2528 ms 264076 KB Output is correct
57 Correct 2590 ms 282152 KB Output is correct
58 Correct 2709 ms 293580 KB Output is correct
59 Correct 2685 ms 308936 KB Output is correct
60 Correct 2631 ms 322876 KB Output is correct
61 Correct 2668 ms 338732 KB Output is correct
62 Correct 2655 ms 357280 KB Output is correct
63 Correct 2601 ms 378960 KB Output is correct
64 Correct 1024 ms 302672 KB Output is correct
65 Correct 1000 ms 302724 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 104540 KB Output is correct
2 Correct 32 ms 104532 KB Output is correct
3 Correct 35 ms 104540 KB Output is correct
4 Correct 36 ms 104576 KB Output is correct
5 Correct 32 ms 104528 KB Output is correct
6 Correct 33 ms 104528 KB Output is correct
7 Correct 32 ms 104536 KB Output is correct
8 Correct 33 ms 104532 KB Output is correct
9 Correct 32 ms 104464 KB Output is correct
10 Correct 33 ms 104492 KB Output is correct
11 Correct 32 ms 104536 KB Output is correct
12 Correct 34 ms 104540 KB Output is correct
13 Correct 31 ms 104536 KB Output is correct
14 Correct 32 ms 104532 KB Output is correct
15 Correct 32 ms 104544 KB Output is correct
16 Correct 31 ms 104536 KB Output is correct
17 Correct 31 ms 104536 KB Output is correct
18 Correct 32 ms 104728 KB Output is correct
19 Correct 32 ms 104540 KB Output is correct
20 Correct 33 ms 104532 KB Output is correct
21 Correct 32 ms 104540 KB Output is correct
22 Correct 33 ms 104528 KB Output is correct
23 Correct 32 ms 104540 KB Output is correct
24 Correct 32 ms 104564 KB Output is correct
25 Correct 31 ms 104536 KB Output is correct
26 Correct 34 ms 104424 KB Output is correct
27 Correct 48 ms 109444 KB Output is correct
28 Correct 47 ms 108920 KB Output is correct
29 Correct 175 ms 127572 KB Output is correct
30 Correct 180 ms 127864 KB Output is correct
31 Correct 162 ms 128836 KB Output is correct
32 Correct 163 ms 129144 KB Output is correct
33 Correct 179 ms 126548 KB Output is correct
34 Correct 183 ms 127048 KB Output is correct
35 Correct 163 ms 130428 KB Output is correct
36 Correct 171 ms 129360 KB Output is correct
37 Correct 188 ms 127564 KB Output is correct
38 Correct 161 ms 125528 KB Output is correct
39 Correct 175 ms 130892 KB Output is correct
40 Correct 170 ms 125772 KB Output is correct
41 Correct 171 ms 125468 KB Output is correct
42 Correct 163 ms 132432 KB Output is correct
43 Correct 162 ms 126036 KB Output is correct
44 Correct 164 ms 126084 KB Output is correct
45 Correct 100 ms 118540 KB Output is correct
46 Correct 140 ms 109744 KB Output is correct
47 Correct 1426 ms 161832 KB Output is correct
48 Correct 1897 ms 194308 KB Output is correct
49 Correct 2179 ms 220552 KB Output is correct
50 Correct 2172 ms 220744 KB Output is correct
51 Correct 2144 ms 221908 KB Output is correct
52 Correct 2466 ms 249604 KB Output is correct
53 Correct 2410 ms 250240 KB Output is correct
54 Correct 2409 ms 248976 KB Output is correct
55 Correct 2411 ms 247720 KB Output is correct
56 Correct 2528 ms 264076 KB Output is correct
57 Correct 2590 ms 282152 KB Output is correct
58 Correct 2709 ms 293580 KB Output is correct
59 Correct 2685 ms 308936 KB Output is correct
60 Correct 2631 ms 322876 KB Output is correct
61 Correct 2668 ms 338732 KB Output is correct
62 Correct 2655 ms 357280 KB Output is correct
63 Correct 2601 ms 378960 KB Output is correct
64 Correct 1024 ms 302672 KB Output is correct
65 Correct 1000 ms 302724 KB Output is correct
66 Correct 139 ms 123476 KB Output is correct
67 Correct 342 ms 138068 KB Output is correct
68 Correct 763 ms 233184 KB Output is correct
69 Correct 908 ms 235736 KB Output is correct
70 Correct 1018 ms 239748 KB Output is correct
71 Correct 3413 ms 164792 KB Output is correct
72 Correct 4088 ms 202672 KB Output is correct
73 Correct 4105 ms 252408 KB Output is correct
74 Correct 4179 ms 255728 KB Output is correct
75 Correct 4122 ms 252620 KB Output is correct
76 Correct 4058 ms 221720 KB Output is correct
77 Correct 4043 ms 223920 KB Output is correct
78 Correct 4097 ms 221740 KB Output is correct
79 Correct 4194 ms 285664 KB Output is correct
80 Correct 4240 ms 301052 KB Output is correct
81 Correct 4260 ms 286968 KB Output is correct
82 Correct 4273 ms 327824 KB Output is correct
83 Correct 4392 ms 331172 KB Output is correct
84 Correct 4002 ms 382684 KB Output is correct
85 Correct 1885 ms 305408 KB Output is correct