oj.uz

답안 #1027808

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1027808 2024-07-19T10:14:26 Z shenfe1 Tiles (BOI24_tiles) C++17
19 / 100
 29 ms 14932 KB 
#include <bits/stdc++.h>

// #pragma GCC optimize("Ofast")

#define ll long long
#define lb lower_bound
#define ub upper_bound
#define pii pair<int,int>
#define pll pair<ll,ll>
#define F first
#define S second
#define ld long double
#define pb push_back
#define all(v) v.begin(),v.end()
#define in insert
#define sz(s) (int)s.size()
#define int ll
#define ppb pop_back
#define mem(a,i) memset(a,i,sizeof(a))

using namespace std;

const int MAX=2e5+15;
const ll inf=1e18;
const int mod=1e9+7;

const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};

int binpow(int a,int n){
    if(!n)return 1;
    if(n%2==1)return a*binpow(a,n-1)%mod;
    int k=binpow(a,n/2);
    return k*k%mod;
}

int n,m;
int x[MAX],y[MAX];
vector<pii> vec[MAX];

void solve(){
    cin>>n>>m;
    set<int> st;
    map<int,int> mp;
    int cur=0;
    for(int i=1;i<=n;i++){
        cin>>x[i]>>y[i];
        assert(y[i]<=1000);
        // y[i]/=2;
        // st.in(y[i]);
    }
    // for(int x:st){
    //     // while(cur%2!=x%2)cur++;
    //     mp[x]=cur++;
    // }
    // for(int i=1;i<=n;i++){
    //     y[i]=mp[y[i]];
    // }

    for(int i=1;i<=n;i++){
        int nx=x[i%n+1],ny=y[i%n+1];
        if(nx==x[i]){
            vec[x[i]].pb({min(ny,y[i]),max(ny,y[i])-1});
        }
    }
    int ans=0;
    // T.init();
    vector<int> use(MAX,0),push(MAX,0);
    for(int i=0;i<m;i++){
        for(auto [l,r]:vec[i]){
            int sum=0;
            for(int j=l;j<=r;j++){
                sum+=use[j];
                use[j]^=1;
            }
            assert(sum==0||sum==r-l+1);
        }
        int sum=0;
        for(int j=0;j<=1000;j++){
            if(push[j]){
                if(!use[j]){
                    cout<<ans<<"\n";
                    return;
                }
                else{
                    push[j]=0;
                }
            }
            else{
                if(use[j]){
                    push[j]=1;
                }
            }
            sum+=push[j];
        }
        for(int j=0;j<=1000;){
            if(push[j]){
                if(push[j+1])j+=2;
                else{
                    cout<<ans<<"\n";
                    return;
                }
            }
            else j++;
        }
        if(!sum)ans=max(ans,i+1);
        // assert(ans<=m);
    }
    cout<<ans<<"\n";
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--)solve();
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:45:9: warning: unused variable 'cur' [-Wunused-variable]
   45 |     int cur=0;
      |         ^~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8288 KB Output is correct
2 Runtime error 5 ms 10076 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8288 KB Output is correct
2 Runtime error 5 ms 10076 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8280 KB Output is correct
2 Runtime error 5 ms 10148 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8284 KB Output is correct
2 Correct 3 ms 8288 KB Output is correct
3 Correct 3 ms 8312 KB Output is correct
4 Correct 4 ms 8280 KB Output is correct
5 Correct 21 ms 13148 KB Output is correct
6 Correct 22 ms 13152 KB Output is correct
7 Correct 4 ms 8284 KB Output is correct
8 Correct 4 ms 8284 KB Output is correct
9 Correct 5 ms 8284 KB Output is correct
10 Correct 5 ms 8540 KB Output is correct
11 Correct 5 ms 8284 KB Output is correct
12 Correct 6 ms 8284 KB Output is correct
13 Correct 5 ms 8284 KB Output is correct
14 Correct 3 ms 8284 KB Output is correct
15 Correct 4 ms 8156 KB Output is correct
16 Correct 4 ms 8284 KB Output is correct
17 Correct 22 ms 13340 KB Output is correct
18 Correct 29 ms 13040 KB Output is correct
19 Correct 8 ms 8284 KB Output is correct
20 Correct 6 ms 8284 KB Output is correct
21 Correct 4 ms 8284 KB Output is correct
22 Correct 3 ms 8284 KB Output is correct
23 Correct 4 ms 8292 KB Output is correct
24 Correct 4 ms 8284 KB Output is correct
25 Correct 4 ms 8304 KB Output is correct
26 Correct 4 ms 8284 KB Output is correct
27 Correct 4 ms 8284 KB Output is correct
28 Correct 4 ms 8144 KB Output is correct
29 Correct 3 ms 8216 KB Output is correct
30 Correct 3 ms 8284 KB Output is correct
31 Correct 4 ms 8308 KB Output is correct
32 Correct 3 ms 8284 KB Output is correct
33 Correct 5 ms 8280 KB Output is correct
34 Correct 3 ms 8252 KB Output is correct
35 Correct 3 ms 8284 KB Output is correct
36 Correct 8 ms 8304 KB Output is correct
37 Correct 5 ms 8284 KB Output is correct
38 Correct 5 ms 8116 KB Output is correct
39 Correct 4 ms 8284 KB Output is correct
40 Correct 3 ms 8284 KB Output is correct
41 Correct 4 ms 8284 KB Output is correct
42 Correct 3 ms 8284 KB Output is correct
43 Correct 3 ms 8160 KB Output is correct
44 Correct 3 ms 8232 KB Output is correct
45 Correct 3 ms 8284 KB Output is correct
46 Correct 4 ms 8284 KB Output is correct
47 Correct 4 ms 8288 KB Output is correct
48 Correct 5 ms 8284 KB Output is correct
49 Correct 23 ms 14932 KB Output is correct
50 Correct 23 ms 14916 KB Output is correct
51 Correct 23 ms 14416 KB Output is correct
52 Correct 23 ms 14428 KB Output is correct
53 Correct 5 ms 8284 KB Output is correct
54 Correct 3 ms 8284 KB Output is correct
55 Correct 5 ms 8424 KB Output is correct
56 Correct 5 ms 8540 KB Output is correct
57 Correct 4 ms 8284 KB Output is correct
58 Correct 4 ms 8284 KB Output is correct
59 Correct 4 ms 8284 KB Output is correct
60 Correct 5 ms 8284 KB Output is correct
61 Correct 4 ms 8284 KB Output is correct
62 Correct 3 ms 8284 KB Output is correct
63 Correct 6 ms 8796 KB Output is correct
64 Correct 6 ms 8536 KB Output is correct
65 Correct 5 ms 8284 KB Output is correct
66 Correct 3 ms 8284 KB Output is correct
67 Correct 5 ms 8232 KB Output is correct
68 Correct 3 ms 8284 KB Output is correct
69 Correct 4 ms 8280 KB Output is correct
70 Correct 4 ms 8284 KB Output is correct
71 Correct 6 ms 8248 KB Output is correct
72 Correct 3 ms 8284 KB Output is correct

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 7 ms 10028 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 10032 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8288 KB Output is correct
2 Runtime error 5 ms 10076 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -