oj.uz

Submission #964401

# Submission time Handle Problem Language Result Execution time Memory
964401 2024-04-16T19:13:24 Z BestCrazyNoob Seats (IOI18_seats) C++17
25 / 100
 4000 ms 76660 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};
    }
};

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

void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
    assert(H <= 10'000);
    assert(W <= 10'000);
    ::R = R;
    ::C = C;
    rSeg = SegTree(R);
    cSeg = SegTree(C);
}

int swap_seats(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;
}

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 'int swap_seats(int, int)':
seats.cpp:75:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     while (i < C.size()) {
      |            ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 4 ms 524 KB Output is correct
3 Correct 3 ms 436 KB Output is correct
4 Correct 3 ms 600 KB Output is correct
5 Correct 25 ms 348 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 7 ms 600 KB Output is correct
9 Correct 8 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 3 ms 600 KB Output is correct
12 Correct 30 ms 552 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 4 ms 524 KB Output is correct
3 Correct 3 ms 436 KB Output is correct
4 Correct 3 ms 600 KB Output is correct
5 Correct 25 ms 348 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 7 ms 600 KB Output is correct
9 Correct 8 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 3 ms 600 KB Output is correct
12 Correct 30 ms 552 KB Output is correct
13 Correct 8 ms 1368 KB Output is correct
14 Correct 9 ms 1444 KB Output is correct
15 Correct 6 ms 1372 KB Output is correct
16 Execution timed out 4025 ms 1372 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 60696 KB Output is correct
2 Correct 215 ms 76560 KB Output is correct
3 Correct 2659 ms 76536 KB Output is correct
4 Correct 284 ms 76524 KB Output is correct
5 Correct 256 ms 76556 KB Output is correct
6 Correct 3421 ms 76660 KB Output is correct
7 Correct 1136 ms 76556 KB Output is correct
8 Correct 440 ms 76588 KB Output is correct
9 Correct 2213 ms 76536 KB Output is correct
10 Correct 1946 ms 76580 KB Output is correct

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1116 KB Output is correct
2 Correct 55 ms 8252 KB Output is correct
3 Correct 1983 ms 76640 KB Output is correct
4 Correct 185 ms 76524 KB Output is correct
5 Runtime error 174 ms 48296 KB Execution killed with signal 6
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1424 KB Output is correct
2 Correct 25 ms 2112 KB Output is correct
3 Correct 200 ms 2024 KB Output is correct
4 Correct 2336 ms 2180 KB Output is correct
5 Correct 54 ms 2920 KB Output is correct
6 Runtime error 173 ms 49488 KB Execution killed with signal 6
7 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 4 ms 524 KB Output is correct
3 Correct 3 ms 436 KB Output is correct
4 Correct 3 ms 600 KB Output is correct
5 Correct 25 ms 348 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 7 ms 600 KB Output is correct
9 Correct 8 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 3 ms 600 KB Output is correct
12 Correct 30 ms 552 KB Output is correct
13 Correct 8 ms 1368 KB Output is correct
14 Correct 9 ms 1444 KB Output is correct
15 Correct 6 ms 1372 KB Output is correct
16 Execution timed out 4025 ms 1372 KB Time limit exceeded
17 Halted 0 ms 0 KB -