oj.uz

Submission #165901

# Submission time Handle Problem Language Result Execution time Memory
165901 2019-11-29T14:19:03 Z Akashi Examination (JOI19_examination) C++14
2 / 100
 3000 ms 783252 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;

struct grades{
    int x, y, z;
    bool operator < (const grades &aux)const{
        if(z != aux.z) return z > aux.z;
        if(x != aux.x) return x > aux.x;
        return y > aux.y;
    }
};
struct teacher{
    int x, y, z, p;
    bool operator < (const teacher &aux)const{
        if(z != aux.z) return z > aux.z;
        if(x != aux.x) return x > aux.x;
        return y > aux.y;
    }
};

grades a[100005];
teacher b[100005];
int ans[100005];

int n, q;

struct node{
    int tip, val = 0;
    node *arb;
    node *left, *right;

    node(bool x){
        tip = x;
        val = 0;
        arb = left = right = NULL;
    }
};

node *arb;

int y, nx, ny, NR;
void update(int x, node *nod = arb, int st = 1, int dr = NR){
    if(st == dr){
        if(nod->tip == 1){
            if(nod->arb == NULL) nod->arb = new node(0);
            update(y, nod->arb);
        }
        else ++nod->val;
        return ;
    }

    int mij = (st + dr) / 2;
    if(x <= mij){
        if(nod->left == NULL) nod->left = new node(nod->tip);
        update(x, nod->left, st, mij);
    }
    else{
        if(nod->right == NULL) nod->right = new node(nod->tip);
        update(x, nod->right, mij + 1, dr);
    }


    if(nod->tip == 1){
        if(nod->arb == NULL) nod->arb = new node(0);
        update(y, nod->arb);
    }
    else{
        nod->val = 0;
        if(nod->left != NULL) nod->val += nod->left->val;
        if(nod->right!= NULL) nod->val += nod->right->val;
    }
}

int yr, yl;
int query(int x, int y, node *nod = arb, int st = 1, int dr = NR){
    if(x <= st && dr <= y){
        if(nod->tip == 1){
            if(nod->arb == NULL) return 0;
            return query(yl, yr, nod->arb);
        }
        else return nod->val;
    }

    int mij = (st + dr) / 2;

    int val = 0;
    if(x <= mij){
        if(nod->left != NULL) val += query(x, y, nod->left, st, mij);
    }
    if(mij + 1 <= y){
        if(nod->right != NULL) val += query(x, y, nod->right, mij + 1, dr);
    }

    return val;
}

set <int> sx, sy;
map <int, int> fx, fy;

int main()
{
    scanf("%d%d", &n, &q);
    for(int i = 1; i <= n ; ++i){
        scanf("%d%d", &a[i].x, &a[i].y);
        a[i].z = a[i].x + a[i].y;
        sx.insert(a[i].x); sy.insert(a[i].y);
    }

    for(int i = 1; i <= q ; ++i){
        scanf("%d%d%d", &b[i].x, &b[i].y, &b[i].z), b[i].p = i;
        sx.insert(b[i].x); sy.insert(b[i].y);
    }

    for(auto it : sx) fx[it] = ++nx;
    for(auto it : sy) fy[it] = ++ny;

    NR = max(nx, ny);

    for(int i = 1; i <= n ; ++i) a[i].x = fx[a[i].x], a[i].y = fy[a[i].y];
    for(int i = 1; i <= q ; ++i) b[i].x = fx[b[i].x], b[i].y = fy[b[i].y];

    sort(a + 1, a + n + 1);
    sort(b + 1, b + q + 1);

    int j = 1;
    arb = new node(1);
    for(int i = 1; i <= q ; ++i){
        while(j <= n && a[j].z >= b[i].z){
            y = a[j].y;
            update(a[j].x);
            ++j;
        }

        yl = b[i].y; yr = NR;
        ans[b[i].p] = query(b[i].x, NR);
    }

    for(int i = 1; i <= q ; ++i) printf("%d\n", ans[i]);

    return 0;
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:103:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &q);
     ~~~~~^~~~~~~~~~~~~~~~
examination.cpp:105:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &a[i].x, &a[i].y);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:111:51: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &b[i].x, &b[i].y, &b[i].z), b[i].p = i;
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 13 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 55 ms 18296 KB Output is correct
8 Correct 50 ms 18308 KB Output is correct
9 Correct 57 ms 18296 KB Output is correct
10 Correct 26 ms 7800 KB Output is correct
11 Correct 24 ms 7416 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 51 ms 18296 KB Output is correct
14 Correct 52 ms 18168 KB Output is correct
15 Correct 51 ms 18336 KB Output is correct
16 Correct 22 ms 6520 KB Output is correct
17 Correct 23 ms 6904 KB Output is correct
18 Correct 4 ms 476 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3093 ms 783252 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3093 ms 783252 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 13 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 55 ms 18296 KB Output is correct
8 Correct 50 ms 18308 KB Output is correct
9 Correct 57 ms 18296 KB Output is correct
10 Correct 26 ms 7800 KB Output is correct
11 Correct 24 ms 7416 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 51 ms 18296 KB Output is correct
14 Correct 52 ms 18168 KB Output is correct
15 Correct 51 ms 18336 KB Output is correct
16 Correct 22 ms 6520 KB Output is correct
17 Correct 23 ms 6904 KB Output is correct
18 Correct 4 ms 476 KB Output is correct
19 Execution timed out 3093 ms 783252 KB Time limit exceeded
20 Halted 0 ms 0 KB -