oj.uz

Submission #964415

# Submission time Handle Problem Language Result Execution time Memory
964415 2024-04-16T19:36:23 Z BestCrazyNoob Seats (IOI18_seats) C++17
37 / 100
 4000 ms 60688 KB 
#include "seats.h"
#include <cassert>
#include <tuple>

using namespace std;

struct Node {
    int mn, mx;
    Node(): mn(1e9), mx(0) {}
    Node(int a): mn(a), mx(a) {}
    Node(Node l, Node r) {
        mn = min(l.mn, r.mn);
        mx = max(l.mx, r.mx);
    }
};

struct SegTree {
    int sz;
    vector<Node> tree;
    int ql, qr;
    SegTree() {}
    SegTree(vector<int> v) {
        sz = 1;
        while (sz < v.size()) sz *= 2;
        tree.resize(2*sz, Node());
        for (int i = 0; i < v.size(); i++) tree[sz+i] = Node(v[i]);
        for (int i = v.size(); i < sz; i++) tree[sz+i] = Node();
        for (int i = sz-1; i >= 1; i--) tree[i] = Node(tree[2*i], tree[2*i+1]);
    }
    void update(int i, int x) {
        i += sz;
        tree[i] = Node(x);
        while (i > 1) {
            i /= 2;
            tree[i] = Node(tree[2*i], tree[2*i+1]);
        }
    }
    Node __query(int ni, int nl, int nr) {
        if (qr <= nl || nr <= ql) return Node();
        if (ql <= nl && nr <= qr) return tree[ni];
        int nm = (nl+nr)/2;
        return Node(__query(2*ni, nl, nm), __query(2*ni+1, nm, nr));
    }
    pair<int, int> query(int l, int r) {
        ql = l;
        qr = r;
        auto res = __query(1, 0, sz);
        return {res.mn, res.mx};
    }
};

bool usesol1;

// sol1
vector<int> mxC, mnC, mxR, mnR;
int ans;

// sol2
vector<int> R, C;
SegTree rSeg, cSeg;

void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
    ::R = R;
    ::C = C;
    usesol1 = H > 1'000 || W > 1'000;
    if (usesol1) {
        // sol1
        mxC.resize(C.size());
        mnC.resize(C.size());
        mxR.resize(C.size());
        mnR.resize(C.size());
        mxC[0] = mnC[0] = C[0];
        mxR[0] = mnR[0] = R[0];
        for (int i = 1; i < C.size(); i++) {
            mxC[i] = max(C[i], mxC[i-1]);
            mxR[i] = max(R[i], mxR[i-1]);
            mnC[i] = min(C[i], mnC[i-1]);
            mnR[i] = min(R[i], mnR[i-1]);
        }
        for (int i = 0; i < C.size(); i++) {
            ans += (mxC[i] - mnC[i] + 1) * (mxR[i] - mnR[i] + 1) == i+1;
        }
    } else {
        // sol2
        rSeg = SegTree(R);
        cSeg = SegTree(C);
    }
}

int sol1(int a, int b) {
    // a < b WLOG
    if (a > b) swap(a, b);

    for (int i = a; i <= b; i++) {
        ans -= (mxC[i] - mnC[i] + 1) * (mxR[i] - mnR[i] + 1) == i+1;
    }

    swap(R[a], R[b]);
    swap(C[a], C[b]);
    if (a == 0) {
        mxC[0] = mnC[0] = C[0];
        mxR[0] = mnR[0] = R[0];
    }
    for (int i = max(1, a); i <= b; i++) {
        mxC[i] = max(C[i], mxC[i-1]);
        mxR[i] = max(R[i], mxR[i-1]);
        mnC[i] = min(C[i], mnC[i-1]);
        mnR[i] = min(R[i], mnR[i-1]);
    }

    for (int i = a; i <= b; i++) {
        ans += (mxC[i] - mnC[i] + 1) * (mxR[i] - mnR[i] + 1) == i+1;
    }
    return ans;
}

int sol2(int a, int b) {
    // update
    swap(R[a], R[b]);
    swap(C[a], C[b]);
    rSeg.update(a, R[a]);
    rSeg.update(b, R[b]);
    cSeg.update(a, C[a]);
    cSeg.update(b, C[b]);
    // query
    int i = 1, ans = 1;
    int mnR = R[0], mnC = C[0], mxR = R[0], mxC = C[0];
    while (i < C.size()) {
        tie(mnR, mxR) = rSeg.query(0, i);
        tie(mnC, mxC) = cSeg.query(0, i);
        if ((mxR - mnR + 1) * (mxC - mnC + 1) == i) {
            ans++;
            i += min(mxR - mnR + 1, mxC - mnC + 1);
        } else {
            i = (mxR - mnR + 1) * (mxC - mnC + 1);
        }
    }
    return ans;
}

int swap_seats(int a, int b) {
    if (usesol1) return sol1(a, b);
    return sol2(a, b);
}

Compilation message

seats.cpp: In constructor 'SegTree::SegTree(std::vector<int>)':
seats.cpp:24:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         while (sz < v.size()) sz *= 2;
      |                ~~~^~~~~~~~~~
seats.cpp:26:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |         for (int i = 0; i < v.size(); i++) tree[sz+i] = Node(v[i]);
      |                         ~~^~~~~~~~~~
seats.cpp: In function 'void give_initial_chart(int, int, std::vector<int>, std::vector<int>)':
seats.cpp:74:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |         for (int i = 1; i < C.size(); i++) {
      |                         ~~^~~~~~~~~~
seats.cpp:80:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |         for (int i = 0; i < C.size(); i++) {
      |                         ~~^~~~~~~~~~
seats.cpp: In function 'int sol2(int, int)':
seats.cpp:128:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |     while (i < C.size()) {
      |            ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 21 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 3 ms 420 KB Output is correct
8 Correct 6 ms 528 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 3 ms 456 KB Output is correct
12 Correct 24 ms 348 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 21 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 3 ms 420 KB Output is correct
8 Correct 6 ms 528 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 3 ms 456 KB Output is correct
12 Correct 24 ms 348 KB Output is correct
13 Correct 8 ms 1264 KB Output is correct
14 Correct 9 ms 1112 KB Output is correct
15 Correct 115 ms 824 KB Output is correct
16 Correct 105 ms 824 KB Output is correct
17 Correct 110 ms 856 KB Output is correct
18 Correct 692 ms 1236 KB Output is correct
19 Correct 607 ms 1244 KB Output is correct
20 Correct 102 ms 840 KB Output is correct
21 Correct 101 ms 732 KB Output is correct
22 Correct 103 ms 836 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 60652 KB Output is correct
2 Correct 208 ms 60680 KB Output is correct
3 Correct 2775 ms 60688 KB Output is correct
4 Correct 265 ms 60492 KB Output is correct
5 Correct 249 ms 60688 KB Output is correct
6 Correct 3541 ms 60672 KB Output is correct
7 Correct 1164 ms 60648 KB Output is correct
8 Correct 485 ms 60508 KB Output is correct
9 Correct 2196 ms 60656 KB Output is correct
10 Correct 1911 ms 60648 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1112 KB Output is correct
2 Correct 57 ms 6924 KB Output is correct
3 Correct 1962 ms 60624 KB Output is correct
4 Correct 198 ms 60480 KB Output is correct
5 Correct 398 ms 39472 KB Output is correct
6 Correct 387 ms 55380 KB Output is correct
7 Correct 397 ms 55636 KB Output is correct
8 Correct 406 ms 55336 KB Output is correct
9 Correct 414 ms 55356 KB Output is correct
10 Correct 399 ms 55360 KB Output is correct
11 Correct 412 ms 55368 KB Output is correct

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1356 KB Output is correct
2 Correct 22 ms 1372 KB Output is correct
3 Correct 223 ms 1440 KB Output is correct
4 Correct 2577 ms 1476 KB Output is correct
5 Correct 1014 ms 1704 KB Output is correct
6 Execution timed out 4038 ms 39724 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 21 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 3 ms 420 KB Output is correct
8 Correct 6 ms 528 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 3 ms 456 KB Output is correct
12 Correct 24 ms 348 KB Output is correct
13 Correct 8 ms 1264 KB Output is correct
14 Correct 9 ms 1112 KB Output is correct
15 Correct 115 ms 824 KB Output is correct
16 Correct 105 ms 824 KB Output is correct
17 Correct 110 ms 856 KB Output is correct
18 Correct 692 ms 1236 KB Output is correct
19 Correct 607 ms 1244 KB Output is correct
20 Correct 102 ms 840 KB Output is correct
21 Correct 101 ms 732 KB Output is correct
22 Correct 103 ms 836 KB Output is correct
23 Correct 207 ms 60652 KB Output is correct
24 Correct 208 ms 60680 KB Output is correct
25 Correct 2775 ms 60688 KB Output is correct
26 Correct 265 ms 60492 KB Output is correct
27 Correct 249 ms 60688 KB Output is correct
28 Correct 3541 ms 60672 KB Output is correct
29 Correct 1164 ms 60648 KB Output is correct
30 Correct 485 ms 60508 KB Output is correct
31 Correct 2196 ms 60656 KB Output is correct
32 Correct 1911 ms 60648 KB Output is correct
33 Correct 7 ms 1112 KB Output is correct
34 Correct 57 ms 6924 KB Output is correct
35 Correct 1962 ms 60624 KB Output is correct
36 Correct 198 ms 60480 KB Output is correct
37 Correct 398 ms 39472 KB Output is correct
38 Correct 387 ms 55380 KB Output is correct
39 Correct 397 ms 55636 KB Output is correct
40 Correct 406 ms 55336 KB Output is correct
41 Correct 414 ms 55356 KB Output is correct
42 Correct 399 ms 55360 KB Output is correct
43 Correct 412 ms 55368 KB Output is correct
44 Correct 17 ms 1356 KB Output is correct
45 Correct 22 ms 1372 KB Output is correct
46 Correct 223 ms 1440 KB Output is correct
47 Correct 2577 ms 1476 KB Output is correct
48 Correct 1014 ms 1704 KB Output is correct
49 Execution timed out 4038 ms 39724 KB Time limit exceeded
50 Halted 0 ms 0 KB -