oj.uz

답안 #317613

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
317613 2020-10-30T04:10:06 Z tar_palantir 운세 보기 2 (JOI14_fortune_telling2) C++17
100 / 100
 396 ms 23288 KB 
#include<bits/stdc++.h>
#define allof(a)        a.begin(),a.end()
#define int             long long
#define fi              first
#define se              second
#define pb              push_back
#define F(i,a,b)        for(int i=a;i<=b;i++)
#define D(i,a,b)        for(int i=a;i>=b;i--)
#define inf             0x3f3f3f3f3f3f3f3f
#define mn              200001
#define task            "kosaraju"
using namespace std;
const int mod=          1e9+7;
typedef pair<int,int>   ii;
typedef pair<int,ii>    ip;

int n,k;
ii a[mn],t[mn];

struct interval_tree{
    #define mid         (l+r>>1)
    #define lc          2*id,l,mid
    #define rc          2*id+1,mid+1,r

    int st[4*mn],hi[4*mn];
    void update(int id,int l,int r,int i,int val){
        if(l==r){
            st[id]=1;
            hi[id]=val;
            return;
        }
        if(i<=mid)update(lc,i,val);
        else update(rc,i,val);

        st[id]=st[2*id]+st[2*id+1];
        hi[id]=max(hi[2*id],hi[2*id+1]);
    }
    int getsum(int id,int l,int r,int u,int v){
        if(v<l || r<u)return 0;
        if(u<=l && r<=v)return st[id];
        return getsum(lc,u,v)+getsum(rc,u,v);
    }
    int getmax(int id,int l,int r,int u,int v){
        if(v<l || r<u)return -inf;
        if(u<=l && r<=v)return hi[id];
        return max(getmax(lc,u,v),getmax(rc,u,v));
    }
}st1,st2;
int32_t main()
{
    ios::sync_with_stdio(0);
    #ifdef _TPR_
        freopen("t.inp","r",stdin);
        freopen("t.out","w",stdout);
    #endif
    cin>>n>>k;
    F(i,1,n)cin>>a[i].fi>>a[i].se;
    sort(a+1,a+n+1,[](const ii& a,const ii& b)
        {return max(a.fi,a.se)>max(b.fi,b.se);});
    F(i,1,k){
        cin>>t[i].fi;t[i].se=i;
    }
    sort(t+1,t+k+1,[](const ii& a,const ii& b)
        {return a.fi<b.fi;});
    F(i,1,k)st2.update(1,1,k,i,t[i].se);

    int res=0,cur=k;
    F(i,1,n){
        while(cur && t[cur].fi>=max(a[i].fi,a[i].se)){
            st1.update(1,1,k,t[cur].se,1);
            cur--;
        }
        int l=distance(t,lower_bound(t+1,t+k+1,ii(min(a[i].fi,a[i].se),-1)));
        int r=distance(t,lower_bound(t+1,t+k+1,ii(max(a[i].fi,a[i].se),-1)));
        if(l<r){
            int pos=st2.getmax(1,1,k,l,r-1);
            if(st1.getsum(1,1,k,pos+1,k)&1)res+=min(a[i].fi,a[i].se);
            else res+=max(a[i].fi,a[i].se);
        }
        else{
            if(st1.getsum(1,1,k,1,k)&1)res+=a[i].se;
            else res+=a[i].fi;
        }
    }
    cout<<res;
}

Compilation message

fortune_telling2.cpp: In member function 'void interval_tree::update(long long int, long long int, long long int, long long int, long long int)':
fortune_telling2.cpp:21:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   21 |     #define mid         (l+r>>1)
      |                          ~^~
fortune_telling2.cpp:32:15: note: in expansion of macro 'mid'
   32 |         if(i<=mid)update(lc,i,val);
      |               ^~~
fortune_telling2.cpp:21:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   21 |     #define mid         (l+r>>1)
      |                          ~^~
fortune_telling2.cpp:22:32: note: in expansion of macro 'mid'
   22 |     #define lc          2*id,l,mid
      |                                ^~~
fortune_telling2.cpp:32:26: note: in expansion of macro 'lc'
   32 |         if(i<=mid)update(lc,i,val);
      |                          ^~
fortune_telling2.cpp:21:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   21 |     #define mid         (l+r>>1)
      |                          ~^~
fortune_telling2.cpp:23:32: note: in expansion of macro 'mid'
   23 |     #define rc          2*id+1,mid+1,r
      |                                ^~~
fortune_telling2.cpp:33:21: note: in expansion of macro 'rc'
   33 |         else update(rc,i,val);
      |                     ^~
fortune_telling2.cpp: In member function 'long long int interval_tree::getsum(long long int, long long int, long long int, long long int, long long int)':
fortune_telling2.cpp:21:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   21 |     #define mid         (l+r>>1)
      |                          ~^~
fortune_telling2.cpp:22:32: note: in expansion of macro 'mid'
   22 |     #define lc          2*id,l,mid
      |                                ^~~
fortune_telling2.cpp:41:23: note: in expansion of macro 'lc'
   41 |         return getsum(lc,u,v)+getsum(rc,u,v);
      |                       ^~
fortune_telling2.cpp:21:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   21 |     #define mid         (l+r>>1)
      |                          ~^~
fortune_telling2.cpp:23:32: note: in expansion of macro 'mid'
   23 |     #define rc          2*id+1,mid+1,r
      |                                ^~~
fortune_telling2.cpp:41:38: note: in expansion of macro 'rc'
   41 |         return getsum(lc,u,v)+getsum(rc,u,v);
      |                                      ^~
fortune_telling2.cpp: In member function 'long long int interval_tree::getmax(long long int, long long int, long long int, long long int, long long int)':
fortune_telling2.cpp:21:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   21 |     #define mid         (l+r>>1)
      |                          ~^~
fortune_telling2.cpp:22:32: note: in expansion of macro 'mid'
   22 |     #define lc          2*id,l,mid
      |                                ^~~
fortune_telling2.cpp:46:27: note: in expansion of macro 'lc'
   46 |         return max(getmax(lc,u,v),getmax(rc,u,v));
      |                           ^~
fortune_telling2.cpp:21:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   21 |     #define mid         (l+r>>1)
      |                          ~^~
fortune_telling2.cpp:23:32: note: in expansion of macro 'mid'
   23 |     #define rc          2*id+1,mid+1,r
      |                                ^~~
fortune_telling2.cpp:46:42: note: in expansion of macro 'rc'
   46 |         return max(getmax(lc,u,v),getmax(rc,u,v));
      |                                          ^~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 13 ms 1664 KB Output is correct
15 Correct 28 ms 3072 KB Output is correct
16 Correct 42 ms 3328 KB Output is correct
17 Correct 61 ms 5760 KB Output is correct
18 Correct 60 ms 5760 KB Output is correct
19 Correct 56 ms 5760 KB Output is correct
20 Correct 58 ms 5760 KB Output is correct
21 Correct 53 ms 5752 KB Output is correct
22 Correct 46 ms 5752 KB Output is correct
23 Correct 46 ms 5760 KB Output is correct
24 Correct 49 ms 5760 KB Output is correct
25 Correct 42 ms 5760 KB Output is correct
26 Correct 46 ms 5760 KB Output is correct
27 Correct 50 ms 5760 KB Output is correct
28 Correct 49 ms 5752 KB Output is correct
29 Correct 44 ms 5760 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 13 ms 1664 KB Output is correct
15 Correct 28 ms 3072 KB Output is correct
16 Correct 42 ms 3328 KB Output is correct
17 Correct 61 ms 5760 KB Output is correct
18 Correct 60 ms 5760 KB Output is correct
19 Correct 56 ms 5760 KB Output is correct
20 Correct 58 ms 5760 KB Output is correct
21 Correct 53 ms 5752 KB Output is correct
22 Correct 46 ms 5752 KB Output is correct
23 Correct 46 ms 5760 KB Output is correct
24 Correct 49 ms 5760 KB Output is correct
25 Correct 42 ms 5760 KB Output is correct
26 Correct 46 ms 5760 KB Output is correct
27 Correct 50 ms 5760 KB Output is correct
28 Correct 49 ms 5752 KB Output is correct
29 Correct 44 ms 5760 KB Output is correct
30 Correct 149 ms 20088 KB Output is correct
31 Correct 215 ms 20728 KB Output is correct
32 Correct 267 ms 21496 KB Output is correct
33 Correct 388 ms 23032 KB Output is correct
34 Correct 87 ms 19960 KB Output is correct
35 Correct 394 ms 23216 KB Output is correct
36 Correct 396 ms 23160 KB Output is correct
37 Correct 390 ms 23032 KB Output is correct
38 Correct 337 ms 23032 KB Output is correct
39 Correct 346 ms 23160 KB Output is correct
40 Correct 262 ms 23032 KB Output is correct
41 Correct 315 ms 23160 KB Output is correct
42 Correct 330 ms 23288 KB Output is correct
43 Correct 193 ms 16504 KB Output is correct
44 Correct 195 ms 16888 KB Output is correct
45 Correct 196 ms 18808 KB Output is correct
46 Correct 266 ms 23280 KB Output is correct
47 Correct 278 ms 23032 KB Output is correct
48 Correct 285 ms 23032 KB Output is correct
49 Correct 268 ms 23032 KB Output is correct