oj.uz

Submission #293146

# Submission time Handle Problem Language Result Execution time Memory
293146 2020-09-07T16:49:07 Z SamAnd Seats (IOI18_seats) C++17
100 / 100
 2145 ms 157256 KB 
#include "seats.h"
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
typedef long long ll;
const int N = 1000006;
const int xx[9] = {0, 1, 0, 1, -1, 0, 1, -1, -1};
const int yy[9] = {0, 0, 1, 1, 0, -1, -1, 1, -1};

int n, m;
int x[N], y[N];

int** a;

struct ban
{
    pair<int, int> s, minu;
    int q;
    ban()
    {
        s = minu = m_p(0, 0);
        q = 0;
    }
    ban(pair<int, int> x)
    {
        s = x;
        minu = x;
        q = 1;
    }
};

ban t[N * 4];

pair<int, int> operator+(const pair<int, int>& a, const pair<int, int>& b)
{
    return m_p(a.fi + b.fi, a.se + b.se);
}

ban mer(const ban& l, const ban& r)
{
    ban res;
    res.s = l.s + r.s;
    if (l.minu < l.s + r.minu)
    {
        res.minu = l.minu;
        res.q = l.q;
    }
    else if (l.minu > l.s + r.minu)
    {
        res.minu = l.s + r.minu;
        res.q = r.q;
    }
    else
    {
        res.minu = l.minu;
        res.q = l.q + r.q;
    }
    return res;
}

void ubd(int tl, int tr, int x, pair<int, int> y, int pos)
{
    if (tl == tr)
    {
        t[pos] = ban(y);
        return;
    }
    int m = (tl + tr) / 2;
    if (x <= m)
        ubd(tl, m, x, y, pos * 2);
    else
        ubd(m + 1, tr, x, y, pos * 2 + 1);
    t[pos] = mer(t[pos * 2], t[pos * 2 + 1]);
}

void ubdd(int i, int j)
{
    if (a[i][j] == n * m + 5)
        return;
    pair<int, int> q = m_p(0, 0);
    for (int sx = i - 1; sx <= i; ++sx)
    {
        for (int sy = j - 1; sy <= j; ++sy)
        {
            int qq = 0;
            for (int ii = 0; ii < 4; ++ii)
            {
                int hx = sx + xx[ii];
                int hy = sy + yy[ii];
                if (a[hx][hy] <= a[i][j])
                    ++qq;
            }
            if (qq == 1)
                q.se++;
            else if (qq == 2)
                q.se--;
            else if (qq == 3)
                q.fi++;
            else
                q.fi--;
        }
    }
    ubd(1, n * m, a[i][j], q, 1);
}

void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C)
{
    n = H;
    m = W;
    for (int i = 0; i < n * m; ++i)
    {
        x[i + 1] = R[i] + 1;
        y[i + 1] = C[i] + 1;
    }
    a = new int*[n + 5];
    for (int i = 0; i < n + 5; ++i)
    {
        a[i] = new int[m + 5];
        for (int j = 0; j < m + 5; ++j)
            a[i][j] = n * m + 5;
    }
    for (int i = 1; i <= n * m; ++i)
    {
        a[x[i]][y[i]] = i;
    }
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            ubdd(i, j);
        }
    }
}

int swap_seats(int u1, int u2)
{
    ++u1;
    ++u2;
    swap(x[u1], x[u2]);
    swap(y[u1], y[u2]);
    a[x[u1]][y[u1]] = u1;
    a[x[u2]][y[u2]] = u2;
    for (int i = 0; i < 9; ++i)
    {
        int hx = x[u1] + xx[i];
        int hy = y[u1] + yy[i];
        ubdd(hx, hy);
    }
    for (int i = 0; i < 9; ++i)
    {
        int hx = x[u2] + xx[i];
        int hy = y[u2] + yy[i];
        ubdd(hx, hy);
    }
    return t[1].q;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 78712 KB Output is correct
2 Correct 67 ms 78840 KB Output is correct
3 Correct 72 ms 78840 KB Output is correct
4 Correct 60 ms 78840 KB Output is correct
5 Correct 59 ms 78840 KB Output is correct
6 Correct 69 ms 78840 KB Output is correct
7 Correct 74 ms 78772 KB Output is correct
8 Correct 69 ms 78840 KB Output is correct
9 Correct 70 ms 78840 KB Output is correct
10 Correct 72 ms 78840 KB Output is correct
11 Correct 69 ms 78840 KB Output is correct
12 Correct 70 ms 78840 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 78712 KB Output is correct
2 Correct 67 ms 78840 KB Output is correct
3 Correct 72 ms 78840 KB Output is correct
4 Correct 60 ms 78840 KB Output is correct
5 Correct 59 ms 78840 KB Output is correct
6 Correct 69 ms 78840 KB Output is correct
7 Correct 74 ms 78772 KB Output is correct
8 Correct 69 ms 78840 KB Output is correct
9 Correct 70 ms 78840 KB Output is correct
10 Correct 72 ms 78840 KB Output is correct
11 Correct 69 ms 78840 KB Output is correct
12 Correct 70 ms 78840 KB Output is correct
13 Correct 96 ms 79096 KB Output is correct
14 Correct 102 ms 79096 KB Output is correct
15 Correct 74 ms 79352 KB Output is correct
16 Correct 77 ms 79480 KB Output is correct
17 Correct 88 ms 79224 KB Output is correct
18 Correct 94 ms 79096 KB Output is correct
19 Correct 92 ms 79224 KB Output is correct
20 Correct 84 ms 79352 KB Output is correct
21 Correct 80 ms 79352 KB Output is correct
22 Correct 72 ms 79480 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1421 ms 106148 KB Output is correct
2 Correct 1086 ms 122056 KB Output is correct
3 Correct 1078 ms 122104 KB Output is correct
4 Correct 909 ms 122188 KB Output is correct
5 Correct 922 ms 122056 KB Output is correct
6 Correct 946 ms 122104 KB Output is correct
7 Correct 969 ms 122104 KB Output is correct
8 Correct 1047 ms 122060 KB Output is correct
9 Correct 1036 ms 122000 KB Output is correct
10 Correct 1002 ms 122104 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 78984 KB Output is correct
2 Correct 176 ms 82492 KB Output is correct
3 Correct 922 ms 122104 KB Output is correct
4 Correct 1408 ms 122104 KB Output is correct
5 Correct 920 ms 141676 KB Output is correct
6 Correct 1459 ms 157256 KB Output is correct
7 Correct 949 ms 128588 KB Output is correct
8 Correct 1107 ms 122360 KB Output is correct
9 Correct 1010 ms 122360 KB Output is correct
10 Correct 1000 ms 126780 KB Output is correct
11 Correct 945 ms 145536 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 79732 KB Output is correct
2 Correct 121 ms 80372 KB Output is correct
3 Correct 140 ms 80380 KB Output is correct
4 Correct 166 ms 80576 KB Output is correct
5 Correct 205 ms 80860 KB Output is correct
6 Correct 1155 ms 130776 KB Output is correct
7 Correct 1236 ms 130772 KB Output is correct
8 Correct 1104 ms 130748 KB Output is correct
9 Correct 1569 ms 130936 KB Output is correct
10 Correct 1056 ms 128888 KB Output is correct
11 Correct 1070 ms 128840 KB Output is correct
12 Correct 1043 ms 128888 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 78712 KB Output is correct
2 Correct 67 ms 78840 KB Output is correct
3 Correct 72 ms 78840 KB Output is correct
4 Correct 60 ms 78840 KB Output is correct
5 Correct 59 ms 78840 KB Output is correct
6 Correct 69 ms 78840 KB Output is correct
7 Correct 74 ms 78772 KB Output is correct
8 Correct 69 ms 78840 KB Output is correct
9 Correct 70 ms 78840 KB Output is correct
10 Correct 72 ms 78840 KB Output is correct
11 Correct 69 ms 78840 KB Output is correct
12 Correct 70 ms 78840 KB Output is correct
13 Correct 96 ms 79096 KB Output is correct
14 Correct 102 ms 79096 KB Output is correct
15 Correct 74 ms 79352 KB Output is correct
16 Correct 77 ms 79480 KB Output is correct
17 Correct 88 ms 79224 KB Output is correct
18 Correct 94 ms 79096 KB Output is correct
19 Correct 92 ms 79224 KB Output is correct
20 Correct 84 ms 79352 KB Output is correct
21 Correct 80 ms 79352 KB Output is correct
22 Correct 72 ms 79480 KB Output is correct
23 Correct 1421 ms 106148 KB Output is correct
24 Correct 1086 ms 122056 KB Output is correct
25 Correct 1078 ms 122104 KB Output is correct
26 Correct 909 ms 122188 KB Output is correct
27 Correct 922 ms 122056 KB Output is correct
28 Correct 946 ms 122104 KB Output is correct
29 Correct 969 ms 122104 KB Output is correct
30 Correct 1047 ms 122060 KB Output is correct
31 Correct 1036 ms 122000 KB Output is correct
32 Correct 1002 ms 122104 KB Output is correct
33 Correct 99 ms 78984 KB Output is correct
34 Correct 176 ms 82492 KB Output is correct
35 Correct 922 ms 122104 KB Output is correct
36 Correct 1408 ms 122104 KB Output is correct
37 Correct 920 ms 141676 KB Output is correct
38 Correct 1459 ms 157256 KB Output is correct
39 Correct 949 ms 128588 KB Output is correct
40 Correct 1107 ms 122360 KB Output is correct
41 Correct 1010 ms 122360 KB Output is correct
42 Correct 1000 ms 126780 KB Output is correct
43 Correct 945 ms 145536 KB Output is correct
44 Correct 107 ms 79732 KB Output is correct
45 Correct 121 ms 80372 KB Output is correct
46 Correct 140 ms 80380 KB Output is correct
47 Correct 166 ms 80576 KB Output is correct
48 Correct 205 ms 80860 KB Output is correct
49 Correct 1155 ms 130776 KB Output is correct
50 Correct 1236 ms 130772 KB Output is correct
51 Correct 1104 ms 130748 KB Output is correct
52 Correct 1569 ms 130936 KB Output is correct
53 Correct 1056 ms 128888 KB Output is correct
54 Correct 1070 ms 128840 KB Output is correct
55 Correct 1043 ms 128888 KB Output is correct
56 Correct 169 ms 80372 KB Output is correct
57 Correct 274 ms 80316 KB Output is correct
58 Correct 434 ms 80824 KB Output is correct
59 Correct 1585 ms 123128 KB Output is correct
60 Correct 2145 ms 123256 KB Output is correct
61 Correct 1481 ms 123128 KB Output is correct
62 Correct 1211 ms 132728 KB Output is correct
63 Correct 1964 ms 129528 KB Output is correct
64 Correct 1554 ms 124920 KB Output is correct
65 Correct 1556 ms 123224 KB Output is correct
66 Correct 1609 ms 123512 KB Output is correct
67 Correct 1524 ms 127864 KB Output is correct
68 Correct 1296 ms 137464 KB Output is correct
69 Correct 1930 ms 146424 KB Output is correct