oj.uz

답안 #54521

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
54521 2018-07-04T00:08:50 Z KieranHorgan 게임 (IOI13_game) C++17
80 / 100
 5549 ms 257024 KB 
#pragma GCC optimize("Ofast")
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
 
long long gcd2(long long X, long long Y) {
    long long tmp;
    if(X==0&&Y==0) return 0;
    if(X==0) return Y;
    if(Y==0) return X;
    while (X != Y && Y != 0) {
        tmp = X;
        X = Y;
        Y = tmp % Y;
    }
    return X;
}
 
int R, C;
struct colNode {
    int l, r;
    ll st;
    colNode *left, *right;
    colNode(int lv, int rv): left(NULL), right(NULL), st(0) {l=lv; r=rv;};
};
set<pair<int, int>> isNew;
ll query(int x, int y, colNode *cur) {
    if(cur == NULL) return 0;
    if(x >= cur->r || y <= cur->l) return 0;
    if(y >= cur->r && x <= cur->l) return cur->st;
    if(cur->right==NULL) return query(x, y, cur->left);
    if(cur->left==NULL) return query(x, y, cur->right);
    return gcd2(query(x, y, cur->left),
                query(x, y, cur->right));
}
void update(int j, int val, colNode *cur, colNode *rowL, colNode *rowR) {
    if(cur == NULL) return;
    if(j < cur->l || j >= cur->r) return;
    if(cur->l + 1 == cur->r) {
        if(rowL == NULL && rowR == NULL) cur->st = val;
        else if(rowL == NULL) cur->st = query(j, j+1, rowR);
        else if(rowR == NULL) cur->st = query(j, j+1, rowL);
        else cur->st = gcd2(query(j, j+1, rowL), query(j, j+1, rowR));
        return;
    }
    int mid = (cur->l + cur->r)/2;
    if(j < mid) {
        if(cur->left == NULL) {
            cur->left = new colNode(j, j+1);
        } else if(cur->left->l != cur->l || cur->left->r != mid) {
            int mid2 = (cur->l+mid)/2;
            if(cur->left->l < mid2) {
                cur->left->left = new colNode(cur->left->l, cur->left->r);
                cur->left->left->st = cur->left->st;
            } else {
                cur->left->right = new colNode(cur->left->l, cur->left->r);
                cur->left->right->st = cur->left->st;
            }
            cur->left->l = cur->l;
            cur->left->r = mid;
        }
        update(j, val, cur->left, rowL, rowR);
    } else {
        if(cur->right == NULL) {
            cur->right = new colNode(mid, cur->r);
        } else if(cur->right->l != mid || cur->right->r != cur->r) {
            int mid2 = (cur->r+mid)/2;
            if(cur->right->l < mid2) {
                cur->right->left = new colNode(cur->right->l, cur->right->r);
                cur->right->left->st = cur->right->st;
            } else {
                cur->right->right = new colNode(cur->right->l, cur->right->r);
                cur->right->right->st = cur->right->st;
            }
            cur->right->l = mid;
            cur->right->r = cur->r;
        }
        update(j, val, cur->right, rowL, rowR);
    }
    if(cur->left==NULL) cur->st = cur->right->st;
    else if(cur->right==NULL) cur->st = cur->left->st;
    else cur->st = gcd2(cur->left->st, cur->right->st);
}
struct rowNode {
    int l, r;
    rowNode *left, *right;
    colNode *col;
    rowNode(int lv, int rv): left(NULL), right(NULL) {l=lv; r=rv; col = new colNode(0, C);};
};
void update(int i, int j, int val, rowNode *cur) {
    if(cur == NULL) return;
    if(i < cur->l || i >= cur->r) return;
    int mid = (cur->l + cur->r)/2;    
    if(cur->l+1 == cur-> r) {
    } else if(i < mid) {
        if(cur->left == NULL) {
            cur->left = new rowNode(cur->l, mid);
        } else if(cur->left->l != cur->l || cur->left->r != mid) {
            int mid2 = (cur->l+mid)/2;
            if(cur->left->l < mid2) {
                cur->left->left = new rowNode(cur->left->l, cur->left->r);
                cur->left->left->col = cur->left->col;
            } else {
                cur->left->right = new rowNode(cur->left->l, cur->left->r);
                cur->left->right->col = cur->left->col;
            }
            cur->left->l = cur->l;
            cur->left->r = mid;
        }
        update(i, j, val, cur->left);
    } else {
        if(cur->right == NULL) {
            cur->right = new rowNode(mid, cur->r);
        } else if(cur->right->l != mid || cur->right->r != cur->r) {
            int mid2 = (cur->r+mid)/2;
            if(cur->right->l < mid2) {
                cur->right->left = new rowNode(cur->right->l, cur->right->r);
                cur->right->left->col = cur->right->col;
            } else {
                cur->right->right = new rowNode(cur->right->l, cur->right->r);
                cur->right->right->col = cur->right->col;
            }
            cur->right->l = mid;
            cur->right->r = cur->r;
        }
        update(i, j, val, cur->right);
    }
    if(cur->left == NULL && cur->right == NULL) update(j, val, cur->col, NULL, NULL);
    else if(cur->left == NULL) update(j, val, cur->col, NULL, cur->right->col);
    else if(cur->right == NULL) update(j, val, cur->col, cur->left->col, NULL);
    else update(j, val, cur->col, cur->left->col, cur->right->col);
}
ll query(int x, int y, int nx, int ny, rowNode *cur) {
    if(cur == NULL) return 0;
    if(x >= cur->r || y <= cur->l) return 0;
    if(y >= cur->r && x <= cur->l) return query(nx, ny, cur->col);
    if(cur->right==NULL) return query(x, y, nx, ny, cur->left);
    if(cur->left==NULL) return query(x, y, nx, ny, cur->right);
    return gcd2(query(x, y, nx, ny, cur->left),
                query(x, y, nx, ny, cur->right));
}

rowNode root(0,1);

void init(signed r, signed c) {
    R = r;
    C = c;
    root = *(new rowNode(0, R));
}

void update(signed P, signed Q, long long K) {
    // cerr << "Update:" << endl;
    update(P, Q, K, &root);
    // cerr << endl;
    // update(Q, K, &root);
    // cerr << endl;
}
 
long long calculate(signed P, signed Q, signed U, signed V) {
    // cerr << "Query:" << endl;
    
    // cerr << endl;
    // cerr << endl;
    return query(P, U+1, Q, V+1, &root);;
}

Compilation message

grader.c: In function 'int main()':
grader.c:18:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
  int res;
      ^~~
game.cpp: In constructor 'colNode::colNode(long long int, long long int)':
game.cpp:25:21: warning: 'colNode::right' will be initialized after [-Wreorder]
     colNode *left, *right;
                     ^~~~~
game.cpp:24:8: warning:   'long long int colNode::st' [-Wreorder]
     ll st;
        ^~
game.cpp:26:5: warning:   when initialized here [-Wreorder]
     colNode(int lv, int rv): left(NULL), right(NULL), st(0) {l=lv; r=rv;};
     ^~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 592 KB Output is correct
2 Correct 2 ms 592 KB Output is correct
3 Correct 2 ms 592 KB Output is correct
4 Correct 653 ms 15136 KB Output is correct
5 Correct 425 ms 19288 KB Output is correct
6 Correct 677 ms 20800 KB Output is correct
7 Correct 913 ms 25288 KB Output is correct
8 Correct 590 ms 25340 KB Output is correct
9 Correct 782 ms 27920 KB Output is correct
10 Correct 690 ms 27920 KB Output is correct
11 Correct 2 ms 27920 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 27920 KB Output is correct
2 Correct 2 ms 27920 KB Output is correct
3 Correct 4 ms 27920 KB Output is correct
4 Correct 2 ms 27920 KB Output is correct
5 Correct 2 ms 27920 KB Output is correct
6 Correct 2 ms 27920 KB Output is correct
7 Correct 2 ms 27920 KB Output is correct
8 Correct 2 ms 27920 KB Output is correct
9 Correct 2 ms 27920 KB Output is correct
10 Correct 2 ms 27920 KB Output is correct
11 Correct 2 ms 27920 KB Output is correct
12 Correct 1133 ms 34748 KB Output is correct
13 Correct 2639 ms 34748 KB Output is correct
14 Correct 349 ms 34748 KB Output is correct
15 Correct 3538 ms 34748 KB Output is correct
16 Correct 319 ms 34748 KB Output is correct
17 Correct 1344 ms 34748 KB Output is correct
18 Correct 2233 ms 34748 KB Output is correct
19 Correct 1992 ms 34748 KB Output is correct
20 Correct 1962 ms 34748 KB Output is correct
21 Correct 2 ms 34748 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 34748 KB Output is correct
2 Correct 3 ms 34748 KB Output is correct
3 Correct 3 ms 34748 KB Output is correct
4 Correct 2 ms 34748 KB Output is correct
5 Correct 2 ms 34748 KB Output is correct
6 Correct 2 ms 34748 KB Output is correct
7 Correct 2 ms 34748 KB Output is correct
8 Correct 2 ms 34748 KB Output is correct
9 Correct 2 ms 34748 KB Output is correct
10 Correct 2 ms 34748 KB Output is correct
11 Correct 2 ms 34748 KB Output is correct
12 Correct 719 ms 34748 KB Output is correct
13 Correct 430 ms 34748 KB Output is correct
14 Correct 690 ms 34748 KB Output is correct
15 Correct 816 ms 34748 KB Output is correct
16 Correct 501 ms 34748 KB Output is correct
17 Correct 769 ms 34748 KB Output is correct
18 Correct 696 ms 34748 KB Output is correct
19 Correct 1079 ms 34748 KB Output is correct
20 Correct 2775 ms 34748 KB Output is correct
21 Correct 388 ms 34748 KB Output is correct
22 Correct 3224 ms 34748 KB Output is correct
23 Correct 332 ms 34748 KB Output is correct
24 Correct 1225 ms 34748 KB Output is correct
25 Correct 2440 ms 34748 KB Output is correct
26 Correct 1929 ms 34748 KB Output is correct
27 Correct 1837 ms 34748 KB Output is correct
28 Correct 976 ms 82900 KB Output is correct
29 Correct 2225 ms 82900 KB Output is correct
30 Correct 5453 ms 122900 KB Output is correct
31 Correct 5067 ms 143764 KB Output is correct
32 Correct 590 ms 143764 KB Output is correct
33 Correct 954 ms 143764 KB Output is correct
34 Correct 404 ms 143764 KB Output is correct
35 Correct 1644 ms 143764 KB Output is correct
36 Correct 3205 ms 143764 KB Output is correct
37 Correct 2668 ms 143764 KB Output is correct
38 Correct 2879 ms 143764 KB Output is correct
39 Correct 2155 ms 143764 KB Output is correct
40 Correct 2 ms 143764 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 143764 KB Output is correct
2 Correct 3 ms 143764 KB Output is correct
3 Correct 2 ms 143764 KB Output is correct
4 Correct 3 ms 143764 KB Output is correct
5 Correct 3 ms 143764 KB Output is correct
6 Correct 3 ms 143764 KB Output is correct
7 Correct 2 ms 143764 KB Output is correct
8 Correct 2 ms 143764 KB Output is correct
9 Correct 2 ms 143764 KB Output is correct
10 Correct 3 ms 143764 KB Output is correct
11 Correct 3 ms 143764 KB Output is correct
12 Correct 741 ms 143764 KB Output is correct
13 Correct 626 ms 143764 KB Output is correct
14 Correct 850 ms 143764 KB Output is correct
15 Correct 790 ms 143764 KB Output is correct
16 Correct 492 ms 143764 KB Output is correct
17 Correct 787 ms 143764 KB Output is correct
18 Correct 792 ms 143764 KB Output is correct
19 Correct 1094 ms 143764 KB Output is correct
20 Correct 2938 ms 143764 KB Output is correct
21 Correct 391 ms 143764 KB Output is correct
22 Correct 3127 ms 143764 KB Output is correct
23 Correct 322 ms 143764 KB Output is correct
24 Correct 1269 ms 143764 KB Output is correct
25 Correct 2215 ms 143764 KB Output is correct
26 Correct 1872 ms 143764 KB Output is correct
27 Correct 2062 ms 143764 KB Output is correct
28 Correct 948 ms 143764 KB Output is correct
29 Correct 2089 ms 143764 KB Output is correct
30 Correct 5549 ms 153636 KB Output is correct
31 Correct 4874 ms 174532 KB Output is correct
32 Correct 584 ms 174532 KB Output is correct
33 Correct 905 ms 174532 KB Output is correct
34 Correct 415 ms 174532 KB Output is correct
35 Correct 1855 ms 174532 KB Output is correct
36 Correct 3451 ms 174532 KB Output is correct
37 Correct 2904 ms 174532 KB Output is correct
38 Correct 2591 ms 178156 KB Output is correct
39 Runtime error 1277 ms 257024 KB Memory limit exceeded
40 Halted 0 ms 0 KB -