oj.uz

Submission #447515

# Submission time Handle Problem Language Result Execution time Memory
447515 2021-07-26T15:56:00 Z blue Seats (IOI18_seats) C++17
100 / 100
 2129 ms 180944 KB 
#include "seats.h"
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;

//seats -> 1-indexed, people -> 0-indexed

const int INF = 1e9;
const int maxHW = 1e6;

int H;
int W;
vector<int> R; //row
vector<int> C; //col

vector< vector<int> > P; //person



int* init;



struct segtree
{
    int l;
    int r;

    int lp;
    int mn;
    int count_mn;

    segtree* left = NULL;
    segtree* right = NULL;

    segtree()
    {
        ;
    }

    segtree(int L, int R)
    {
        l = L;
        r = R;

        lp = 0;


        if(l == r)
        {
            mn = init[l];
            count_mn = 1;
        }
        else
        {
            int m = (l+r)/2;

            left = new segtree(l, m);
            right = new segtree(m+1, r);

            if(left->mn < right->mn)
            {
                mn = lp + left->mn;
                count_mn = left->count_mn;
            }
            else if(right->mn < left->mn)
            {
                mn = lp + right->mn;
                count_mn = right->count_mn;
            }
            else
            {
                mn = lp + left->mn;
                count_mn = left->count_mn + right->count_mn;
            }
        }
    }

    void range_add(int L, int R, int V)
    {
        if(R < l || r < L) return;
        else if(L <= l && r <= R)
        {
            lp += V;
            mn += V;
        }
        else
        {
            left->range_add(L, R, V);
            right->range_add(L, R, V);

            if(left->mn < right->mn)
            {
                mn = lp + left->mn;
                count_mn = left->count_mn;
            }
            else if(right->mn < left->mn)
            {
                mn = lp + right->mn;
                count_mn = right->count_mn;
            }
            else
            {
                mn = lp + left->mn;
                count_mn = left->count_mn + right->count_mn;
            }
        }
    }
};


segtree S;

void give_initial_chart(int h, int w, vector<int> r, vector<int> c)
{
    H = h;
    W = w;

    R = r;
    C = c;
    for(int i = 0; i < H*W; i++)
    {
        R[i]++;
        C[i]++;
    }

    P = vector< vector<int> >(H+2);
    for(int i = 0; i <= H+1; i++)
    {
        P[i] = vector<int>(W+2, INF);
    }


    for(int i = 0; i < H*W; i++)
    {
        P[ R[i] ][ C[i] ] = i;
    }

    // cerr << "check\n";

    vector<int> delta_init(1 + H*W, 0);

    for(int i = 0; i <= H; i++)
    {
        for(int j = 0; j <= W; j++)
        {
            vector<int> tmp{P[i][j], P[i+1][j], P[i][j+1], P[i+1][j+1]};
            sort(tmp.begin(), tmp.end());

            // S.range_add(tmp[0], tmp[1]-1, +1);

            if(tmp[0] < 1e8)
                delta_init[ tmp[0] ] += 1;

            if(tmp[1]-1 + 1 < 1e8)
            delta_init[ tmp[1]-1 + 1 ] -= 1;


            // S.range_add(tmp[2], tmp[3]-1, +10);

            if(tmp[2] < 1e8)
                delta_init[ tmp[2] ] += 10;
            if(tmp[3]-1 + 1 < 1e8)
                delta_init[ tmp[3]-1 + 1 ] -= 10;
        }
    }

    // cerr << "check\n";

    init = new int[1 + H*W];
    init[0] = delta_init[0];
    for(int i = 1; i < H*W; i++) init[i] = delta_init[i] + init[i-1];


    S = segtree(0, H*W - 1);


    // cerr << S.count_mn << '\n';
}

int swap_seats(int a, int b)
{
    vector<int> I;
    vector<int> J;

    for(int i = R[a]-1; i <= R[a]; i++)
    {
        for(int j = C[a]-1; j <= C[a]; j++)
        {
            I.push_back(i);
            J.push_back(j);
        }
    }

    for(int i = R[b]-1; i <= R[b]; i++)
    {
        for(int j = C[b]-1; j <= C[b]; j++)
        {
            I.push_back(i);
            J.push_back(j);
        }
    }

    for(int q = 0; q < I.size(); q++)
    {
        int i = I[q];
        int j = J[q];

        vector<int> tmp{P[i][j], P[i+1][j], P[i][j+1], P[i+1][j+1]};
        sort(tmp.begin(), tmp.end());

        S.range_add(tmp[0], tmp[1]-1, -1);
        S.range_add(tmp[2], tmp[3]-1, -10);
    }



    swap(P[ R[a] ][ C[a] ], P[ R[b] ][ C[b] ]);
    swap(R[a], R[b]);
    swap(C[a], C[b]);


    for(int q = 0; q < I.size(); q++)
    {
        int i = I[q];
        int j = J[q];

        vector<int> tmp{P[i][j], P[i+1][j], P[i][j+1], P[i+1][j+1]};
        sort(tmp.begin(), tmp.end());

        S.range_add(tmp[0], tmp[1]-1, +1);
        S.range_add(tmp[2], tmp[3]-1, +10);
    }


    return S.count_mn;
}

Compilation message

seats.cpp: In function 'int swap_seats(int, int)':
seats.cpp:205:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  205 |     for(int q = 0; q < I.size(); q++)
      |                    ~~^~~~~~~~~~
seats.cpp:224:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  224 |     for(int q = 0; q < I.size(); q++)
      |                    ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 460 KB Output is correct
2 Correct 28 ms 452 KB Output is correct
3 Correct 41 ms 416 KB Output is correct
4 Correct 21 ms 472 KB Output is correct
5 Correct 18 ms 436 KB Output is correct
6 Correct 27 ms 452 KB Output is correct
7 Correct 29 ms 412 KB Output is correct
8 Correct 26 ms 416 KB Output is correct
9 Correct 26 ms 432 KB Output is correct
10 Correct 29 ms 416 KB Output is correct
11 Correct 27 ms 452 KB Output is correct
12 Correct 20 ms 452 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 460 KB Output is correct
2 Correct 28 ms 452 KB Output is correct
3 Correct 41 ms 416 KB Output is correct
4 Correct 21 ms 472 KB Output is correct
5 Correct 18 ms 436 KB Output is correct
6 Correct 27 ms 452 KB Output is correct
7 Correct 29 ms 412 KB Output is correct
8 Correct 26 ms 416 KB Output is correct
9 Correct 26 ms 432 KB Output is correct
10 Correct 29 ms 416 KB Output is correct
11 Correct 27 ms 452 KB Output is correct
12 Correct 20 ms 452 KB Output is correct
13 Correct 65 ms 1796 KB Output is correct
14 Correct 72 ms 1740 KB Output is correct
15 Correct 40 ms 1868 KB Output is correct
16 Correct 33 ms 2304 KB Output is correct
17 Correct 52 ms 1832 KB Output is correct
18 Correct 52 ms 1740 KB Output is correct
19 Correct 48 ms 1828 KB Output is correct
20 Correct 45 ms 1996 KB Output is correct
21 Correct 33 ms 1868 KB Output is correct
22 Correct 39 ms 2312 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 681 ms 129988 KB Output is correct
2 Correct 553 ms 130052 KB Output is correct
3 Correct 560 ms 130028 KB Output is correct
4 Correct 527 ms 130032 KB Output is correct
5 Correct 618 ms 130092 KB Output is correct
6 Correct 527 ms 130040 KB Output is correct
7 Correct 535 ms 130028 KB Output is correct
8 Correct 548 ms 130020 KB Output is correct
9 Correct 533 ms 130016 KB Output is correct
10 Correct 555 ms 130128 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 1816 KB Output is correct
2 Correct 116 ms 12636 KB Output is correct
3 Correct 522 ms 130032 KB Output is correct
4 Correct 646 ms 130140 KB Output is correct
5 Correct 562 ms 137840 KB Output is correct
6 Correct 757 ms 180944 KB Output is correct
7 Correct 570 ms 132700 KB Output is correct
8 Correct 592 ms 130168 KB Output is correct
9 Correct 540 ms 130484 KB Output is correct
10 Correct 548 ms 134852 KB Output is correct
11 Correct 573 ms 153560 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 1884 KB Output is correct
2 Correct 125 ms 1984 KB Output is correct
3 Correct 200 ms 2004 KB Output is correct
4 Correct 238 ms 2108 KB Output is correct
5 Correct 356 ms 3392 KB Output is correct
6 Correct 1084 ms 137708 KB Output is correct
7 Correct 1032 ms 137668 KB Output is correct
8 Correct 985 ms 137740 KB Output is correct
9 Correct 1284 ms 137684 KB Output is correct
10 Correct 899 ms 137796 KB Output is correct
11 Correct 925 ms 137692 KB Output is correct
12 Correct 972 ms 137832 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 460 KB Output is correct
2 Correct 28 ms 452 KB Output is correct
3 Correct 41 ms 416 KB Output is correct
4 Correct 21 ms 472 KB Output is correct
5 Correct 18 ms 436 KB Output is correct
6 Correct 27 ms 452 KB Output is correct
7 Correct 29 ms 412 KB Output is correct
8 Correct 26 ms 416 KB Output is correct
9 Correct 26 ms 432 KB Output is correct
10 Correct 29 ms 416 KB Output is correct
11 Correct 27 ms 452 KB Output is correct
12 Correct 20 ms 452 KB Output is correct
13 Correct 65 ms 1796 KB Output is correct
14 Correct 72 ms 1740 KB Output is correct
15 Correct 40 ms 1868 KB Output is correct
16 Correct 33 ms 2304 KB Output is correct
17 Correct 52 ms 1832 KB Output is correct
18 Correct 52 ms 1740 KB Output is correct
19 Correct 48 ms 1828 KB Output is correct
20 Correct 45 ms 1996 KB Output is correct
21 Correct 33 ms 1868 KB Output is correct
22 Correct 39 ms 2312 KB Output is correct
23 Correct 681 ms 129988 KB Output is correct
24 Correct 553 ms 130052 KB Output is correct
25 Correct 560 ms 130028 KB Output is correct
26 Correct 527 ms 130032 KB Output is correct
27 Correct 618 ms 130092 KB Output is correct
28 Correct 527 ms 130040 KB Output is correct
29 Correct 535 ms 130028 KB Output is correct
30 Correct 548 ms 130020 KB Output is correct
31 Correct 533 ms 130016 KB Output is correct
32 Correct 555 ms 130128 KB Output is correct
33 Correct 65 ms 1816 KB Output is correct
34 Correct 116 ms 12636 KB Output is correct
35 Correct 522 ms 130032 KB Output is correct
36 Correct 646 ms 130140 KB Output is correct
37 Correct 562 ms 137840 KB Output is correct
38 Correct 757 ms 180944 KB Output is correct
39 Correct 570 ms 132700 KB Output is correct
40 Correct 592 ms 130168 KB Output is correct
41 Correct 540 ms 130484 KB Output is correct
42 Correct 548 ms 134852 KB Output is correct
43 Correct 573 ms 153560 KB Output is correct
44 Correct 87 ms 1884 KB Output is correct
45 Correct 125 ms 1984 KB Output is correct
46 Correct 200 ms 2004 KB Output is correct
47 Correct 238 ms 2108 KB Output is correct
48 Correct 356 ms 3392 KB Output is correct
49 Correct 1084 ms 137708 KB Output is correct
50 Correct 1032 ms 137668 KB Output is correct
51 Correct 985 ms 137740 KB Output is correct
52 Correct 1284 ms 137684 KB Output is correct
53 Correct 899 ms 137796 KB Output is correct
54 Correct 925 ms 137692 KB Output is correct
55 Correct 972 ms 137832 KB Output is correct
56 Correct 155 ms 1796 KB Output is correct
57 Correct 292 ms 1772 KB Output is correct
58 Correct 518 ms 3052 KB Output is correct
59 Correct 1460 ms 130016 KB Output is correct
60 Correct 2129 ms 129836 KB Output is correct
61 Correct 1157 ms 146372 KB Output is correct
62 Correct 1035 ms 150312 KB Output is correct
63 Correct 1850 ms 149064 KB Output is correct
64 Correct 1352 ms 147248 KB Output is correct
65 Correct 1212 ms 146512 KB Output is correct
66 Correct 1483 ms 146788 KB Output is correct
67 Correct 1406 ms 151108 KB Output is correct
68 Correct 1103 ms 160720 KB Output is correct
69 Correct 1814 ms 169896 KB Output is correct