oj.uz

Submission #52350

# Submission time Handle Problem Language Result Execution time Memory
52350 2018-06-25T14:02:50 Z testtest(#1965) Fortune Telling 2 (JOI14_fortune_telling2) C++11
100 / 100
 526 ms 45424 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <deque>
#include <utility>
#include <bitset>
#include <limits.h>
#include <iostream>
 
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef double lf;
typedef unsigned int uint;
typedef long double llf;
typedef pair<int, int> pii;
 
const int N_ = 200500;
const int K_ = 200500;
const int LEAF = 131072*2;
 
int N, K, A[N_], B[N_];
int T[K_], X[K_], XN;
 
struct state {
    int s, b;
    state (int s = (int)1e8, int b = -(int)1e8): s(s), b(b) { }
};
 
state tree[LEAF+LEAF];
 
state merged (state x, state y) {
    return state(min(x.s, y.s), max(x.b, y.b));
}
 
void upd (int p, state v) {
    p += LEAF;
    tree[p] = merged(tree[p], v);
    while(p >>= 1) tree[p] = merged(tree[p+p], tree[p+p+1]);
}
 
state get (int x, int y) {
    state ret;
    if(x > y || x < 1 || y < 1 || x > XN || y > XN) return ret;
    
    x += LEAF; y += LEAF;
    
    while(x <= y) {
        if((x & 1) == 1) ret = merged(ret, tree[x]);
        if((y & 1) == 0) ret = merged(ret, tree[y]);
        x = (x+1) >> 1;
        y = (y-1) >> 1;
    }
    
    return ret;
}
 
ll ans;
int cntX[N_];
 
vector<int> tree2[LEAF+LEAF];
 
int count2 (vector<int> &a, int v) {
    return (int)a.size() - (upper_bound(a.begin(), a.end(), v-1) - a.begin());
}
 
int get2 (int x, int y, int v) {
    int ret = 0;
    
    x += LEAF; y += LEAF;
    while(x <= y) {
        if((x & 1) == 1) ret += count2 (tree2[x], v);
        if((y & 1) == 0) ret += count2 (tree2[y], v);
        x = (x + 1) >> 1;
        y = (y - 1) >> 1;
    }
    
    return ret;
}
int main() {
    scanf("%d%d", &N, &K);
    for(int i = 1; i <= N; i++) scanf("%d%d", A+i, B+i);
    for(int i = 1; i <= K; i++) scanf("%d", T+i), X[i] = T[i];
    
    sort(X+1, X+K+1);
    XN = unique(X+1, X+K+1) - (X+1);
    
    for(int i = 1; i <= K; i++) {
        int x = lower_bound(X+1, X+XN+1, T[i]) - X;
        upd(x, state(i, i));
        tree2[LEAF+i].push_back(x);
        ++cntX[x];
    }
    
    for(int u = LEAF-1; u > 0; u--) {
        vector<int> &c1 = tree2[u+u];
        vector<int> &c2 = tree2[u+u+1];
        vector<int> &nd = tree2[u];
        nd.reserve(c1.size() + c2.size());
        for(int i = 0, j = 0; nd.size() < c1.size() + c2.size(); ) {
            if(i == c1.size()) nd.push_back(c2[j++]);
            else if(j == c2.size()) nd.push_back(c1[i++]);
            else if(c1[i] < c2[j]) nd.push_back(c1[i++]);
            else nd.push_back(c2[j++]);
        }
    }
    
    for(int i = 1; i <= XN; i++) cntX[i] += cntX[i-1];
    
    for(int i = 1; i <= N; i++) {
        bool r = true;
        if(A[i] > B[i]) r = false, swap(A[i], B[i]);
        int a = upper_bound(X+1, X+XN+1, A[i]-1) - X;
        int b = upper_bound(X+1, X+XN+1, B[i]-1) - X;
        
        state p = get(a, b-1); // I
        state q = get(b, XN);  // J
        int t;
        
        if(q.b == p.b + 1 && p.b > 0) { // .. -> p -> q
            t = A[i];
        }else if(p.b > q.b && q.b > 0) { // q -> q -> q -> p
            t = B[i];
        }else if(p.b - 1 > q.b && p.b > 0) { // .. -> p -> p
            t = B[i];
        }else if(q.b > p.b && p.b > 0) { // .. -> p -> q -> q -> ..
            t = get2(p.b+1, K, b) % 2 == 1 ? A[i] : B[i];
        }else { // only q
            t = r ^ ((K - cntX[a-1]) % 2 == 1) ? A[i] : B[i];
        }
        
        if(K <= 10) {
            if(!r) swap(A[i], B[i]);
        }
        ans += t;
    }
    
    
    
    printf("%lld\n", ans);
    
    return 0;
}
 
/*
 1 5
 5 6
 7
 3
 5
 7
 6
 
 6 4
 
 */

Compilation message

fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:113:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(i == c1.size()) nd.push_back(c2[j++]);
                ~~^~~~~~~~~~~~
fortune_telling2.cpp:114:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             else if(j == c2.size()) nd.push_back(c1[i++]);
                     ~~^~~~~~~~~~~~
fortune_telling2.cpp:93:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &N, &K);
     ~~~~~^~~~~~~~~~~~~~~~
fortune_telling2.cpp:94:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= N; i++) scanf("%d%d", A+i, B+i);
                                 ~~~~~^~~~~~~~~~~~~~~~~~
fortune_telling2.cpp:95:49: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= K; i++) scanf("%d", T+i), X[i] = T[i];
                                 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 16888 KB Output is correct
2 Correct 19 ms 16996 KB Output is correct
3 Correct 17 ms 16996 KB Output is correct
4 Correct 20 ms 16996 KB Output is correct
5 Correct 17 ms 17120 KB Output is correct
6 Correct 17 ms 17120 KB Output is correct
7 Correct 18 ms 17120 KB Output is correct
8 Correct 21 ms 17120 KB Output is correct
9 Correct 17 ms 17188 KB Output is correct
10 Correct 25 ms 17188 KB Output is correct
11 Correct 21 ms 17188 KB Output is correct
12 Correct 18 ms 17188 KB Output is correct
13 Correct 22 ms 17188 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 16888 KB Output is correct
2 Correct 19 ms 16996 KB Output is correct
3 Correct 17 ms 16996 KB Output is correct
4 Correct 20 ms 16996 KB Output is correct
5 Correct 17 ms 17120 KB Output is correct
6 Correct 17 ms 17120 KB Output is correct
7 Correct 18 ms 17120 KB Output is correct
8 Correct 21 ms 17120 KB Output is correct
9 Correct 17 ms 17188 KB Output is correct
10 Correct 25 ms 17188 KB Output is correct
11 Correct 21 ms 17188 KB Output is correct
12 Correct 18 ms 17188 KB Output is correct
13 Correct 22 ms 17188 KB Output is correct
14 Correct 34 ms 18472 KB Output is correct
15 Correct 51 ms 19820 KB Output is correct
16 Correct 77 ms 21284 KB Output is correct
17 Correct 96 ms 22652 KB Output is correct
18 Correct 89 ms 22724 KB Output is correct
19 Correct 85 ms 22724 KB Output is correct
20 Correct 100 ms 22724 KB Output is correct
21 Correct 87 ms 22724 KB Output is correct
22 Correct 76 ms 22724 KB Output is correct
23 Correct 72 ms 22724 KB Output is correct
24 Correct 67 ms 22724 KB Output is correct
25 Correct 67 ms 22724 KB Output is correct
26 Correct 79 ms 22724 KB Output is correct
27 Correct 120 ms 22740 KB Output is correct
28 Correct 88 ms 22876 KB Output is correct
29 Correct 97 ms 22876 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 16888 KB Output is correct
2 Correct 19 ms 16996 KB Output is correct
3 Correct 17 ms 16996 KB Output is correct
4 Correct 20 ms 16996 KB Output is correct
5 Correct 17 ms 17120 KB Output is correct
6 Correct 17 ms 17120 KB Output is correct
7 Correct 18 ms 17120 KB Output is correct
8 Correct 21 ms 17120 KB Output is correct
9 Correct 17 ms 17188 KB Output is correct
10 Correct 25 ms 17188 KB Output is correct
11 Correct 21 ms 17188 KB Output is correct
12 Correct 18 ms 17188 KB Output is correct
13 Correct 22 ms 17188 KB Output is correct
14 Correct 34 ms 18472 KB Output is correct
15 Correct 51 ms 19820 KB Output is correct
16 Correct 77 ms 21284 KB Output is correct
17 Correct 96 ms 22652 KB Output is correct
18 Correct 89 ms 22724 KB Output is correct
19 Correct 85 ms 22724 KB Output is correct
20 Correct 100 ms 22724 KB Output is correct
21 Correct 87 ms 22724 KB Output is correct
22 Correct 76 ms 22724 KB Output is correct
23 Correct 72 ms 22724 KB Output is correct
24 Correct 67 ms 22724 KB Output is correct
25 Correct 67 ms 22724 KB Output is correct
26 Correct 79 ms 22724 KB Output is correct
27 Correct 120 ms 22740 KB Output is correct
28 Correct 88 ms 22876 KB Output is correct
29 Correct 97 ms 22876 KB Output is correct
30 Correct 266 ms 43772 KB Output is correct
31 Correct 328 ms 44180 KB Output is correct
32 Correct 368 ms 44412 KB Output is correct
33 Correct 525 ms 45332 KB Output is correct
34 Correct 240 ms 45332 KB Output is correct
35 Correct 526 ms 45356 KB Output is correct
36 Correct 421 ms 45356 KB Output is correct
37 Correct 431 ms 45356 KB Output is correct
38 Correct 475 ms 45424 KB Output is correct
39 Correct 436 ms 45424 KB Output is correct
40 Correct 385 ms 45424 KB Output is correct
41 Correct 431 ms 45424 KB Output is correct
42 Correct 523 ms 45424 KB Output is correct
43 Correct 296 ms 45424 KB Output is correct
44 Correct 332 ms 45424 KB Output is correct
45 Correct 326 ms 45424 KB Output is correct
46 Correct 337 ms 45424 KB Output is correct
47 Correct 348 ms 45424 KB Output is correct
48 Correct 469 ms 45424 KB Output is correct
49 Correct 442 ms 45424 KB Output is correct