oj.uz

답안 #717241

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
717241 2023-04-01T16:45:32 Z bachhoangxuan Sightseeing in Kyoto (JOI22_kyoto) C++17
100 / 100
 147 ms 12364 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)
- 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 int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int mod2=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=650;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=1000000;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
struct frac{
    int x,y;
    frac(int x,int y):x(x),y(y){}
    friend bool operator<(const frac &a,const frac &b){
        return a.x*b.y<a.y*b.x;
    }
};
int n,m,a[2][maxn],ans;
int nxt[2][maxn];
priority_queue<pair<frac,pii>> pq;
void solve(){
    cin >> n >> m;
    for(int i=1;i<=n;i++){
        cin >> a[0][i];
        nxt[0][i]=i+1;
        if(i>=2) pq.push({frac(a[0][i]-a[0][i-1],1),{i-1,i}});
    }
    for(int i=1;i<=m;i++){
        cin >> a[1][i];
        nxt[1][i]=i+1;
        if(i>=2) pq.push({frac(a[1][i]-a[1][i-1],1),{1-i,-i}});
    }
    int cx=n,cy=m;
    while(!pq.empty()){
        auto x=pq.top();pq.pop();
        int d=0;
        if(x.se.fi<0){x.se.fi=-x.se.fi;x.se.se=-x.se.se;d^=1;}
        if(nxt[d][x.se.fi]==0) continue;
        int p=nxt[d][x.se.se];
        nxt[d][x.se.se]=0;nxt[d][x.se.fi]=p;
        if(p!=(n+1)+d*(m-n))pq.push({frac(a[d][p]-a[d][x.se.fi],p-x.se.fi),{(1-2*d)*x.se.fi,(1-2*d)*p}});
        if(d==0 && cx==x.se.se){ans+=a[1][cy]*(cx-x.se.fi);cx=x.se.fi;}
        else if(d==1 && cy==x.se.se){ans+=a[0][cx]*(cy-x.se.fi);cy=x.se.fi;}
    }
    cout << ans << '\n';
}

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 432 KB Output is correct
11 Correct 2 ms 432 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 224 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 328 KB Output is correct
28 Correct 1 ms 340 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 464 KB Output is correct
4 Correct 54 ms 5836 KB Output is correct
5 Correct 29 ms 5900 KB Output is correct
6 Correct 16 ms 3152 KB Output is correct
7 Correct 138 ms 11468 KB Output is correct
8 Correct 139 ms 11464 KB Output is correct
9 Correct 125 ms 11508 KB Output is correct
10 Correct 141 ms 11452 KB Output is correct
11 Correct 74 ms 11272 KB Output is correct
12 Correct 147 ms 11444 KB Output is correct
13 Correct 136 ms 11480 KB Output is correct
14 Correct 84 ms 11456 KB Output is correct
15 Correct 61 ms 11628 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 432 KB Output is correct
11 Correct 2 ms 432 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 224 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 328 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 464 KB Output is correct
32 Correct 54 ms 5836 KB Output is correct
33 Correct 29 ms 5900 KB Output is correct
34 Correct 16 ms 3152 KB Output is correct
35 Correct 138 ms 11468 KB Output is correct
36 Correct 139 ms 11464 KB Output is correct
37 Correct 125 ms 11508 KB Output is correct
38 Correct 141 ms 11452 KB Output is correct
39 Correct 74 ms 11272 KB Output is correct
40 Correct 147 ms 11444 KB Output is correct
41 Correct 136 ms 11480 KB Output is correct
42 Correct 84 ms 11456 KB Output is correct
43 Correct 61 ms 11628 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 328 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 48 ms 6476 KB Output is correct
56 Correct 1 ms 468 KB Output is correct
57 Correct 5 ms 1112 KB Output is correct
58 Correct 13 ms 2004 KB Output is correct
59 Correct 145 ms 12168 KB Output is correct
60 Correct 146 ms 12224 KB Output is correct
61 Correct 137 ms 12220 KB Output is correct
62 Correct 142 ms 12240 KB Output is correct
63 Correct 77 ms 12028 KB Output is correct
64 Correct 132 ms 12172 KB Output is correct
65 Correct 136 ms 12348 KB Output is correct
66 Correct 91 ms 12344 KB Output is correct
67 Correct 84 ms 12364 KB Output is correct