oj.uz

Submission #1079457

# Submission time Handle Problem Language Result Execution time Memory
1079457 2024-08-28T15:00:20 Z anton Tiles (BOI24_tiles) C++17
71 / 100
 211 ms 25416 KB 
#include<bits/stdc++.h>

using namespace std;

#define int long long
#define pt complex<int>
#define pii pair<int, int>
int N, M;


struct Interval{
    int x;
    int yl, yr;
    bool open = false;

    bool operator<(const Interval& b)const{
        return yl<b.yl;
    }
    vector<Interval> clip(pii other_pair){
        //////cout<<"clipping "<<yl<<" "<<yr<<" "<<other_pair.first<<" "<<other_pair.second<<endl;

        if(yr<other_pair.first || other_pair.second<yl){
            return {*this};
        }
        if(yl<=other_pair.first && other_pair.second<=yr){
            return {Interval{x, yl, other_pair.first-1, open}, Interval{x, other_pair.second+1, yr, open}};
        }
        if(other_pair.first<= yl && yr<=other_pair.second){
            return {Interval{x, 0, -1, open}};
        }
        if(other_pair.first<=yl && other_pair.second<=yr){
            return {Interval{x, other_pair.second+1, yr, open}};
        }
        if(other_pair.first>=yl && other_pair.second>=yr){
            return {Interval{x, yl, other_pair.first-1, open}};
        }
        assert(false);
    }

    bool is_valid(){
        return yl<=yr;
    }

    int len() const{
        return yr-yl+1;
    }
};
Interval merge_inter(Interval a, Interval b){
    return Interval{a.x, a.yl, b.yr, true};
}
struct InterSet{
    set<Interval> intervals;
    bool is_valid = true;
    int nb_unpair= 0;
    
    void insert_small(Interval new_inter){
        if((new_inter.len())%2 ==1){
            nb_unpair++;
        }
        intervals.insert(new_inter);
    }
    std::set<Interval>::iterator erase(std::set<Interval>::iterator it){
        if(((*it).len())%2==1){
            nb_unpair--;
        }
        return intervals.erase(it);
    }
    std::set<Interval>::iterator merge(std::set<Interval>::iterator a, std::set<Interval>::iterator b){
        if(a->yr+1 == b->yl){
            Interval ia = *a;
            Interval ib = *b;
            erase(a);
            erase(b);
            Interval result =merge_inter(ia, ib);
            insert_small(result);
            return intervals.find(result);
        }
        return b;
    }
    void insert(Interval new_inter){
        insert_small(new_inter);
        auto it = intervals.find(new_inter);
        if(it!=intervals.begin()){
            auto prev= it;
            --prev;
            it = merge(prev, it);
        }
        auto next = it;
        next++;
        if(next!=intervals.end()){
            next = merge(it, next);
        }
    }
    
    
    void insert_big(Interval new_inter){
        //cout<<"inserting "<<new_inter.yl<<" "<<new_inter.yr<<endl;

        /*for(auto e: intervals){
            //cout<<e.yl<<" "<<e.yr<<endl;
        }*/
        auto lb = intervals.upper_bound(new_inter);
        if(lb!=intervals.begin()){
            --lb;
        }
        auto rb = intervals.upper_bound(Interval{0, new_inter.yr, new_inter.yr, false});
        if(rb!= intervals.end()){
            ++rb;
        }
            
        vector<Interval> to_insert;
        for(auto it = lb; it!= rb;){
            Interval val = *it;
            it = erase(it);
            vector<Interval>resulting =  val.clip({new_inter.yl, new_inter.yr});
            for(auto val2: resulting){
                if(!new_inter.open){
                    if(pii({val.yl, val.yr}) != pii({val2.yl, val2.yr})){
                        is_valid &= (new_inter.x-val.x)%2==0;
                    }
                }
                
                if(val2.is_valid()){
                    to_insert.push_back(val2);
                }
            }
        }

        for(auto e: to_insert){
            insert(e);
        }
        if(new_inter.open){
            insert(new_inter);
        }
    }
};

signed main(){
    cin>>N>>M;
    vector<pt> pts;
    for(int i = 0; i<N; i++){
        int a, b;
        cin>>a>>b;
        pts.push_back({a, b});
    }

    vector<pair<pt, pt>> edges;
    pt prev= pts.back();
    for(int i = 0; i<N; i++){
        edges.push_back({prev, pts[i]-prev});
        prev = pts[i];
    } 
    
    int area = 0;

    for(auto e: edges){
        area += e.first.imag() * e.second.real();
    }

    if(area<0){
        for(pair<pt, pt>&edge : edges){
            edge = {edge.first+edge.second, -edge.second};
        }
    }

    vector<Interval> inters;
    for(auto e: edges){
        if(e.second.imag()!=0){
            if(e.second.imag()>0){
                inters.push_back(Interval{e.first.real(), e.first.imag(), e.first.imag()+e.second.imag()-1, true});
            }
            else if(e.second.imag()<0){
                inters.push_back(Interval{e.first.real(), e.first.imag()+e.second.imag(), e.first.imag()-1, false});
            }
        }
    }

    auto cmp = [&](Interval& a, Interval& b){
        return a.x<b.x;
    };

    sort(inters.begin(), inters.end(), cmp);
    vector<InterSet> inter_set(2);

    int k = 0;
    Interval prev_inter = Interval{0, 0, 0, true};

    auto chmax = [&](int x){
        if(inter_set[(x+1)%2].intervals.size()==0){
            if(inter_set[0].is_valid && inter_set[1].is_valid){
                k = x;
            }
        }
        else if(inter_set[x%2].intervals.size()==0){
            if(inter_set[0].is_valid && inter_set[1].is_valid){
                k = x-1;
            }
        }
    };
    for(auto e: inters){
        if(e.x!=prev_inter.x){
            //cout<<"nb_unpair: "<<inter_set[0].nb_unpair<<" "<<inter_set[1].nb_unpair<<endl;
            for(int i= 0; i<2; i++){
                inter_set[i].is_valid &= (inter_set[i].nb_unpair ==0);
            }

            chmax(e.x);
        }
        if(inter_set[0].intervals.size()==0 || inter_set[1].intervals.size()==0){
            if(inter_set[0].is_valid && inter_set[1].is_valid){
                k = e.x-1;
            }
        }
        if(e.open){
            inter_set[e.x%2].insert_big(e);
        }
        else{
            inter_set[0].insert_big(e);
            inter_set[1].insert_big(e);
        }

        if(inter_set[0].intervals.size()==0 || inter_set[1].intervals.size()==0){
            if(inter_set[0].is_valid && inter_set[1].is_valid){
                k = e.x;
            }
        }
        prev_inter = e;
    }

    chmax(M);

    cout<<k<<endl;
}

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 0 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 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
9.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 0 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 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 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 412 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 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 1 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 27 ms 4224 KB Output is correct
3 Correct 121 ms 21048 KB Output is correct
4 Correct 58 ms 10848 KB Output is correct
5 Correct 57 ms 10548 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 113 ms 21232 KB Output is correct
9 Correct 67 ms 11840 KB Output is correct
10 Correct 118 ms 20880 KB Output is correct
11 Correct 52 ms 10564 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 115 ms 21152 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 Correct 102 ms 19196 KB Output is correct
6 Correct 111 ms 18964 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 5 ms 1368 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 360 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 96 ms 19980 KB Output is correct
18 Correct 106 ms 21048 KB Output is correct
19 Correct 4 ms 1116 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 1 ms 352 KB Output is correct
22 Correct 0 ms 352 KB Output is correct
23 Correct 1 ms 608 KB Output is correct
24 Correct 1 ms 352 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 352 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 356 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 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 1 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 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 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 101 ms 19324 KB Output is correct
50 Correct 97 ms 19512 KB Output is correct
51 Correct 101 ms 19256 KB Output is correct
52 Correct 108 ms 19260 KB Output is correct
53 Correct 0 ms 344 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 4 ms 1116 KB Output is correct
56 Correct 4 ms 1116 KB Output is correct
57 Incorrect 1 ms 604 KB Output isn't correct
58 Halted 0 ms 0 KB -

Subtask #5
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 59 ms 10572 KB Output is correct
3 Correct 58 ms 11328 KB Output is correct
4 Correct 114 ms 18968 KB Output is correct
5 Correct 104 ms 19264 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 153 ms 20952 KB Output is correct
9 Correct 153 ms 23440 KB Output is correct
10 Correct 155 ms 23860 KB Output is correct
11 Correct 164 ms 23084 KB Output is correct
12 Correct 166 ms 21904 KB Output is correct
13 Correct 150 ms 23088 KB Output is correct
14 Correct 118 ms 24540 KB Output is correct
15 Correct 129 ms 22780 KB Output is correct
16 Correct 121 ms 21048 KB Output is correct
17 Correct 209 ms 23692 KB Output is correct
18 Correct 211 ms 24360 KB Output is correct
19 Correct 196 ms 23232 KB Output is correct
20 Correct 164 ms 21392 KB Output is correct
21 Correct 150 ms 22068 KB Output is correct
22 Correct 163 ms 22708 KB Output is correct
23 Correct 145 ms 21756 KB Output is correct
24 Correct 144 ms 21432 KB Output is correct
25 Correct 139 ms 22688 KB Output is correct
26 Correct 183 ms 25416 KB Output is correct
27 Correct 132 ms 24876 KB Output is correct
28 Correct 159 ms 25388 KB Output is correct
29 Correct 126 ms 22676 KB Output is correct
30 Correct 158 ms 24212 KB Output is correct
31 Correct 124 ms 21556 KB Output is correct
32 Correct 162 ms 21816 KB Output is correct
33 Correct 110 ms 21812 KB Output is correct
34 Correct 52 ms 10324 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 604 KB Output is correct
41 Correct 0 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 440 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 208 ms 21812 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 84 ms 22196 KB Output is correct
53 Correct 99 ms 19260 KB Output is correct
54 Correct 95 ms 20412 KB Output is correct
55 Correct 111 ms 18960 KB Output is correct
56 Correct 103 ms 21308 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Correct 0 ms 432 KB Output is correct
59 Correct 0 ms 348 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 21300 KB Output is correct
2 Correct 58 ms 11216 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 115 ms 21872 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 132 ms 24636 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 186 ms 21832 KB Output is correct
9 Correct 167 ms 22396 KB Output is correct
10 Correct 121 ms 23700 KB Output is correct
11 Correct 120 ms 21436 KB Output is correct
12 Correct 116 ms 21604 KB Output is correct
13 Correct 163 ms 21044 KB Output is correct
14 Correct 155 ms 22496 KB Output is correct
15 Correct 162 ms 23424 KB Output is correct
16 Correct 137 ms 21004 KB Output is correct
17 Correct 136 ms 21812 KB Output is correct
18 Correct 138 ms 21048 KB Output is correct
19 Correct 63 ms 10560 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 111 ms 22328 KB Output is correct
22 Correct 66 ms 11840 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 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 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 344 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 63 ms 10980 KB Output is correct
37 Correct 99 ms 19516 KB Output is correct
38 Correct 97 ms 21096 KB Output is correct
39 Correct 110 ms 21540 KB Output is correct
40 Correct 102 ms 20280 KB Output is correct
41 Correct 0 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 448 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 0 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 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 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 412 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 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 1 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 27 ms 4224 KB Output is correct
34 Correct 121 ms 21048 KB Output is correct
35 Correct 58 ms 10848 KB Output is correct
36 Correct 57 ms 10548 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 113 ms 21232 KB Output is correct
40 Correct 67 ms 11840 KB Output is correct
41 Correct 118 ms 20880 KB Output is correct
42 Correct 52 ms 10564 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 115 ms 21152 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 102 ms 19196 KB Output is correct
54 Correct 111 ms 18964 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 5 ms 1368 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 360 KB Output is correct
61 Correct 1 ms 344 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 96 ms 19980 KB Output is correct
66 Correct 106 ms 21048 KB Output is correct
67 Correct 4 ms 1116 KB Output is correct
68 Correct 1 ms 352 KB Output is correct
69 Correct 1 ms 352 KB Output is correct
70 Correct 0 ms 352 KB Output is correct
71 Correct 1 ms 608 KB Output is correct
72 Correct 1 ms 352 KB Output is correct
73 Correct 0 ms 348 KB Output is correct
74 Correct 0 ms 352 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 1 ms 356 KB Output is correct
77 Correct 1 ms 348 KB Output is correct
78 Correct 1 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 0 ms 348 KB Output is correct
81 Correct 1 ms 344 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 0 ms 348 KB Output is correct
87 Correct 0 ms 348 KB Output is correct
88 Correct 0 ms 348 KB Output is correct
89 Correct 0 ms 348 KB Output is correct
90 Correct 0 ms 348 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 0 ms 348 KB Output is correct
93 Correct 0 ms 348 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 101 ms 19324 KB Output is correct
98 Correct 97 ms 19512 KB Output is correct
99 Correct 101 ms 19256 KB Output is correct
100 Correct 108 ms 19260 KB Output is correct
101 Correct 0 ms 344 KB Output is correct
102 Correct 0 ms 348 KB Output is correct
103 Correct 4 ms 1116 KB Output is correct
104 Correct 4 ms 1116 KB Output is correct
105 Incorrect 1 ms 604 KB Output isn't correct
106 Halted 0 ms 0 KB -