제출 #869646

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
869646		irmuun	Garden (JOI23_garden)	C++17	15 / 100	3080 ms	9304 KiB

garden

#include<bits/stdc++.h>

using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int n,m,d;
    cin>>n>>m>>d;
    vector<int>p(n),q(n),r(m),s(m);
    vector<int>cx(d,0),cy(d,0);
    for(int i=0;i<n;i++){
        cin>>p[i]>>q[i];
        cx[p[i]]++;
        cy[q[i]]++;
    }
    for(int i=0;i<m;i++){
        cin>>r[i]>>s[i];
    }
    int ans=d*d;
    for(int i=0;i<(1<<m);i++){
        for(int j=0;j<m;j++){
            if(i&(1<<j)){
                cx[r[j]]++;
            }
            else{
                cy[s[j]]++;
            }
        }
        int X=0,curx=0;
        for(int j=0;j<2*d;j++){
            if(cx[j%d]==0){
                curx++;
            }
            else{
                curx=0;
            }
            X=max(X,curx);
        }
        int Y=0,cury=0;
        for(int j=0;j<2*d;j++){
            if(cy[j%d]==0){
                cury++;
            }
            else{
                cury=0;
            }
            Y=max(Y,cury);
        }
        ans=min(ans,(d-X)*(d-Y));
        for(int j=0;j<m;j++){
            if(i&(1<<j)){
                cx[r[j]]--;
            }
            else{
                cy[s[j]]--;
            }
        }
    }
    cout<<ans;
}

• Subtask 1: 15 / 15
• Subtask 2: 0 / 6
• Subtask 3: 0 / 8
• Subtask 4: 0 / 16
• Subtask 5: 0 / 30
• Subtask 6: 0 / 25