oj.uz

답안 #656745

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
656745 2022-11-08T07:05:05 Z uylulu 운세 보기 2 (JOI14_fortune_telling2) C++17
35 / 100
 1271 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;

#define ld long double
#define int long long
#define endl "\n"

const int N = 5e5,K = 23;

int a[N + 1],b[N + 1],sign[N + 1];

map<int,int> mp;
vector<int> query;

vector<pair<int,int>> seg[4*N + 1];

void buildST(int id,int l,int r) {
    if(l == r) {
        seg[id] = {{query[l],1}};
        return;
    }
    int mid = (l + r)/2;
    buildST(id*2,l,mid);
    buildST(id*2 + 1,mid + 1,r);

    seg[id] = seg[id*2];
    for(auto u : seg[id*2 + 1]) {
        seg[id].push_back(u);
    }
    sort(seg[id].begin(),seg[id].end());
    
    for(int i = 0;i < seg[id].size();i++) {
        seg[id][i].second = i + 1;
    }
}

int queryST(int id,int l,int r,int u,int v,int val) {
    if(v < l || u > r) return 0;
    
    if(u <= l && v >= r) {
        auto it = lower_bound(seg[id].begin(),seg[id].end(),make_pair(val,(int)-1));
        if(it == seg[id].end()) return 0;

        return (seg[id].size()) - (*it).second + 1;
    }
    int mid = (l + r)/2;
    return queryST(id*2,l,mid,u,v,val) + queryST(id*2 + 1,mid + 1,r,u,v,val);
}

int val[N + 1],lst[N + 1],cnt = 0;
int sparse[N + 1][K + 1],lg[N + 1];

void buildSP() {
    for(int i = 2;i <= N;i++) {
        lg[i] = lg[i/2] + 1;
    }
    for(int i = 0;i <= cnt;i++) {
        sparse[i][0] = lst[i];
    }
    for(int j = 1;j <= K;j++) {
        for(int i = 0;i + (1<<j) <= cnt + 1;i++) {
            sparse[i][j] = max(sparse[i][j - 1],sparse[i + (1<<(j - 1))][j - 1]);
        }
    }
}

int querySP(int l,int r) {
    int len = lg[r - l + 1];
    return max(sparse[l][len],sparse[r - (1<<len) + 1][len]);
}

signed main() {
    // freopen("in.txt","r",stdin);
    // freopen("out.txt","w",stdout);
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

    int n,k;
    cin>>n>>k;
    for(int i = 1;i <= n;i++) {
        cin>>a[i]>>b[i];
        sign[i] = 0;
        if(a[i] > b[i]) {
            sign[i] = 1;
            swap(a[i],b[i]);
        }
        mp[a[i]] = -1;
        mp[b[i]] = -1;
    }
    for(int i = 0;i < k;i++) {
        int x;
        cin>>x;
        mp[x] = -1;
        query.push_back(x);
    }

    for(auto u : mp) {
        mp[u.first] = cnt;
        val[cnt] = u.first;
        cnt++;
    }
    for(int i = 1;i <= n;i++) {
        a[i] = mp[a[i]];
        b[i] = mp[b[i]];
    }
    for(int i = 0;i < query.size();i++) {
        query[i] = mp[query[i]];
    }
    for(int i = 0;i <= cnt;i++) {
        lst[i] = -1;
    }

    for(int i = 0;i < query.size();i++) {
        lst[query[i]] = max(lst[query[i]],i);
    }

    int res = 0;
    buildSP();
    buildST(1,0,query.size() - 1);

    // for(int i = 1;i <= n;i++) {
    //     cout<<a[i]<<" "<<b[i]<<endl;
    // }
    // for(auto u : query) {
    //     cout<<u<<endl;
    // }
    for(int i = 1;i <= n;i++) {
        if(a[i] == b[i]) {
            res += val[a[i]];
            continue;
        }
        // cout<<a[i]<<" "<<b[i]<<endl;
        int nw = querySP(a[i],b[i] - 1);

        int w = sign[i];
        if(nw != -1) w = 1;

        int cnt = queryST(1,0,query.size() - 1,nw + 1,query.size() - 1,b[i]);

        w ^= (cnt%2);

        if(w == 0) {
            res += val[a[i]];
            // cout<<val[a[i]]<<" "<<cnt<<" "<<nw<<endl;
        } else {
            res += val[b[i]];
            // cout<<val[b[i]]<<" "<<cnt<<" "<<nw<<endl;
        }
    }
    cout<<res<<endl;
    

    return 0;
}

Compilation message

fortune_telling2.cpp: In function 'void buildST(long long int, long long int, long long int)':
fortune_telling2.cpp:32:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for(int i = 0;i < seg[id].size();i++) {
      |                   ~~^~~~~~~~~~~~~~~~
fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:105:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |     for(int i = 0;i < query.size();i++) {
      |                   ~~^~~~~~~~~~~~~~
fortune_telling2.cpp:112:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |     for(int i = 0;i < query.size();i++) {
      |                   ~~^~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 51796 KB Output is correct
2 Correct 24 ms 51892 KB Output is correct
3 Correct 26 ms 52188 KB Output is correct
4 Correct 26 ms 52176 KB Output is correct
5 Correct 25 ms 52236 KB Output is correct
6 Correct 26 ms 52204 KB Output is correct
7 Correct 32 ms 52180 KB Output is correct
8 Correct 27 ms 52224 KB Output is correct
9 Correct 28 ms 52268 KB Output is correct
10 Correct 26 ms 51796 KB Output is correct
11 Correct 25 ms 52000 KB Output is correct
12 Correct 26 ms 51944 KB Output is correct
13 Correct 27 ms 52044 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 51796 KB Output is correct
2 Correct 24 ms 51892 KB Output is correct
3 Correct 26 ms 52188 KB Output is correct
4 Correct 26 ms 52176 KB Output is correct
5 Correct 25 ms 52236 KB Output is correct
6 Correct 26 ms 52204 KB Output is correct
7 Correct 32 ms 52180 KB Output is correct
8 Correct 27 ms 52224 KB Output is correct
9 Correct 28 ms 52268 KB Output is correct
10 Correct 26 ms 51796 KB Output is correct
11 Correct 25 ms 52000 KB Output is correct
12 Correct 26 ms 51944 KB Output is correct
13 Correct 27 ms 52044 KB Output is correct
14 Correct 56 ms 62252 KB Output is correct
15 Correct 89 ms 73576 KB Output is correct
16 Correct 141 ms 85040 KB Output is correct
17 Correct 196 ms 96508 KB Output is correct
18 Correct 185 ms 96504 KB Output is correct
19 Correct 181 ms 96580 KB Output is correct
20 Correct 185 ms 96528 KB Output is correct
21 Correct 187 ms 96528 KB Output is correct
22 Correct 135 ms 85840 KB Output is correct
23 Correct 120 ms 80648 KB Output is correct
24 Correct 145 ms 76520 KB Output is correct
25 Correct 137 ms 88884 KB Output is correct
26 Correct 153 ms 83896 KB Output is correct
27 Correct 154 ms 85908 KB Output is correct
28 Correct 152 ms 85836 KB Output is correct
29 Correct 214 ms 91124 KB Output is correct

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 51796 KB Output is correct
2 Correct 24 ms 51892 KB Output is correct
3 Correct 26 ms 52188 KB Output is correct
4 Correct 26 ms 52176 KB Output is correct
5 Correct 25 ms 52236 KB Output is correct
6 Correct 26 ms 52204 KB Output is correct
7 Correct 32 ms 52180 KB Output is correct
8 Correct 27 ms 52224 KB Output is correct
9 Correct 28 ms 52268 KB Output is correct
10 Correct 26 ms 51796 KB Output is correct
11 Correct 25 ms 52000 KB Output is correct
12 Correct 26 ms 51944 KB Output is correct
13 Correct 27 ms 52044 KB Output is correct
14 Correct 56 ms 62252 KB Output is correct
15 Correct 89 ms 73576 KB Output is correct
16 Correct 141 ms 85040 KB Output is correct
17 Correct 196 ms 96508 KB Output is correct
18 Correct 185 ms 96504 KB Output is correct
19 Correct 181 ms 96580 KB Output is correct
20 Correct 185 ms 96528 KB Output is correct
21 Correct 187 ms 96528 KB Output is correct
22 Correct 135 ms 85840 KB Output is correct
23 Correct 120 ms 80648 KB Output is correct
24 Correct 145 ms 76520 KB Output is correct
25 Correct 137 ms 88884 KB Output is correct
26 Correct 153 ms 83896 KB Output is correct
27 Correct 154 ms 85908 KB Output is correct
28 Correct 152 ms 85836 KB Output is correct
29 Correct 214 ms 91124 KB Output is correct
30 Correct 587 ms 179068 KB Output is correct
31 Correct 801 ms 201376 KB Output is correct
32 Correct 989 ms 229164 KB Output is correct
33 Runtime error 1271 ms 262144 KB Execution killed with signal 11
34 Halted 0 ms 0 KB -