oj.uz

Submission #1080736

# Submission time Handle Problem Language Result Execution time Memory
1080736 2024-08-29T13:22:41 Z abouton Tiles (BOI24_tiles) C++17
29 / 100
 57 ms 10304 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

struct ar
{
    int yD, yF, x;
    bool typ;
    bool operator<(const ar &autre) const
    {
        if (x == autre.x) return yD < autre.yD;
        return x < autre.x;
    }
};

struct inter
{
    int y1, y2;
    bool par;
    bool operator<(const inter &autre) const
    {
        return y1 < autre.y1;
    }
};
int nbI;
vector<ar> aretes;
set<inter> cur;
int N, M, maxi;
int nbA;
int nb[2];

void aj(int y1, int y2, int x)
{
    auto it = cur.lower_bound({y2,0,0});
    assert (it != cur.begin());
    assert(it != cur.end());
    auto prec = *prev(it);
    auto suiv = *it;
    if (y1 == prec.y2 && (x%2) == prec.par)
    {
        y1 = prec.y1;
        nb[prec.par]--;
        nbI -= ((prec.y1+prec.y2)%2);
        cur.erase(prec);
        if ((prec.par+x)%2) nb[(x+1)%2]++;
    }
    if (y2==suiv.y1 && (x%2) == prec.par)
    {
        y2 = suiv.y2;
        nb[suiv.par]--;
        nbI -= ((suiv.y1+suiv.y2)%2);
        cur.erase(suiv);
        if ((suiv.par+x)%2) nb[(x+1)%2]++;
    }
    nb[(bool)(x%2)]++;
    cur.insert({y1,y2,(bool)(x%2)});
    nbI += ((y1+y2)%2);
}

void ret(int y1,int y2, int x)
{
    auto it = cur.upper_bound({y1,0,0});
    auto mec = *prev(it);
    //cout << y1 << ' ' << y2 << ' ' << mec.y1 << ' ' << mec.y2 << '\n';
    //cout << (*it).y1 << ' ' << (*it).y2 << '\n';
    //assert (mec.y1 <= y1 && mec.y2 >= y2);
    //cout << "alors " << y1 << ' ' << y2 << ' ' << mec.y1 << ' ' << mec.y2 << '\n';
    if (mec.y2 < y2)
    {
        nb[(x+1)%2] ++;
        cout << maxi;
        exit(0);
    }
    if ((mec.par+x)%2) nb[(x+1)%2] ++;
    nb[mec.par]--;
    nbI -= ((mec.y1+mec.y2)%2);
    cur.erase(mec);

    if (y1 > mec.y1)
    {

        nbI += ((mec.y1+y1)%2);
        //cout << mec.y1 << ' ' <<y1<<'\n';
        cur.insert({mec.y1, y1, (bool)(x%2)});
        //cout << 'a';
        //for (auto i : cur) cout << i.y1 <<i.y2<<' ';
        nb[(bool)(x%2)]++;
    }
    if (y2 < mec.y2)
    {        
        nbI += ((mec.y2+y2)%2);
        cur.insert({y2, mec.y2, (bool)(x%2)});
        nb[(bool)(x%2)]++;
    }
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin >> N >> M;
    maxi = 0;
    bool sens = 0;
    int precX, precY, x0, y0;
    cin >> precX >> precY;
    x0 = precX; y0 = precY;
    for (int i = 0; i < N; i ++)
    {
        int x, y;
        if (i<N-1) cin >> x >> y;
        else
        {
            x = x0; y = y0;
        }
        if (x == precX)
        {
            aretes.push_back({precY, y, x, 0});
        }
        if (x == 0 && precX == 0) {sens = !(y>precY);}
        precX = x; precY = y;
    }
    nbA = aretes.size();
    for (int i = 0; i < nbA; i ++)
    {
        aretes[i].typ = sens ^ (aretes[i].yF > aretes[i].yD);
        //cout << (int) sens << (int)(aretes[i].yF>aretes[i].yD);
        if (aretes[i].yF < aretes[i].yD) swap(aretes[i].yD, aretes[i].yF);
    }

    //for (auto i : aretes)
    //{
    //    cout << i.yD << ' ' << i.yF << ' ' << i.x << ' ' << (int)i.typ << '\n';
    //}

    sort(aretes.begin(), aretes.end());
    cur.insert({-1, -1,0});
    cur.insert({1000000001, 1000000001, 0});
    for (int i = 0; i < nbA; i ++)
    {
        if (nb[(aretes[i].x+1)%2]==0)
            maxi = aretes[i].x;
        else
            maxi = aretes[i].x-1;
            
        if (aretes[i].typ) aj(aretes[i].yD, aretes[i].yF, aretes[i].x);
        else ret(aretes[i].yD, aretes[i].yF, aretes[i].x);

        /*cout << "nouv : " << aretes[i].yD << ' ' << aretes[i].yF << ' ' << aretes[i].x << '\n';
        for (auto truc : cur)
        {
            cout << truc.y1 << ' ' << truc.y2 << " et " << nbI << '\n';
        }
        cout << '\n';*/

        if (i == nbA-1 || aretes[i+1].x > aretes[i].x)
        {
            //cout << nb[0] << ' ' << nb[1] << '\n';
            if (nbI!=0)
            {
                cout << maxi <<'\n';
                return 0;
            }
        }
    }
    cout << maxi << '\n';
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 412 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 412 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 8 ms 2232 KB Output is correct
3 Correct 43 ms 7288 KB Output is correct
4 Correct 27 ms 4052 KB Output is correct
5 Incorrect 24 ms 4052 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Incorrect 32 ms 5844 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 23 ms 4088 KB Output is correct
3 Incorrect 28 ms 4052 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 7364 KB Output is correct
2 Correct 24 ms 4056 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 43 ms 7452 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 47 ms 7380 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 57 ms 8360 KB Output is correct
9 Correct 54 ms 7392 KB Output is correct
10 Correct 41 ms 7368 KB Output is correct
11 Correct 35 ms 7368 KB Output is correct
12 Correct 38 ms 7400 KB Output is correct
13 Correct 47 ms 7368 KB Output is correct
14 Correct 50 ms 7380 KB Output is correct
15 Correct 56 ms 7380 KB Output is correct
16 Correct 54 ms 10000 KB Output is correct
17 Correct 54 ms 10304 KB Output is correct
18 Correct 51 ms 9924 KB Output is correct
19 Correct 21 ms 4048 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 44 ms 7532 KB Output is correct
22 Correct 25 ms 4560 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 416 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 21 ms 4008 KB Output is correct
37 Correct 30 ms 5844 KB Output is correct
38 Correct 30 ms 5576 KB Output is correct
39 Correct 35 ms 5840 KB Output is correct
40 Correct 39 ms 5648 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 412 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Halted 0 ms 0 KB -