답안 #1062921

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1062921	2024-08-17T11:55:08 Z	Unforgettablepl	Cultivation (JOI17_cultivation)	C++17	5 / 100	42 ms	604 KB

cultivation

#include <bits/stdc++.h>
using namespace std;

// #define int long long


int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int r,c,n;
    cin >> r >> c >> n;
    vector<pair<int,int>> points(n);
    for(auto&[a,b]:points)cin>>a>>b;
    int tar = r*c;
    auto check = [&](int chosenR,int chosenC){
        vector grid(101,vector(101,0));
        for(auto&[x,y]:points) {
            grid[x][y]++;
            grid[x+chosenR][y]--;
            grid[x][y+chosenC]--;
            grid[x+chosenR][y+chosenC]++;
        }
        for(int i=1;i<=100;i++) {
            for(int j=1;j<=100;j++) {
                grid[i][j]+=grid[i][j-1];
            }
        }
        for(int i=1;i<=100;i++) {
            for(int j=1;j<=100;j++) {
                grid[j][i]+=grid[j-1][i];
            }
        }
        for(int i=1;i<=100;i++) {
            for(int j=1;j<=100;j++) {
                grid[i][j]=min(1,grid[i][j])+grid[i-1][j]+grid[i][j-1]-grid[i-1][j-1];
            }
        }
        auto get = [&](int x1,int y1,int x2,int y2) {
            return grid[x2][y2]-grid[x1-1][y2]-grid[x2][y1-1]+grid[x1-1][y1-1];
        };
        for(int i=1;i<=chosenR;i++) {
            for(int j=1;j<=chosenC;j++) {
                if(get(i,j,i+r-1,j+c-1)==tar)return true;
            }
        }
        return false;
    };
    int ans = r+c-2;
    for(int R=1;R<=r;R++) {
        for(int C=1;C<=c;C++) {
            if(check(R,C)) {
                ans=min(ans,R+C-2);
            }
        }
    }
    cout << ans << '\n';
}

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	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	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 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	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	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	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 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	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	7 ms	500 KB	Output is correct
18	Correct	18 ms	344 KB	Output is correct
19	Correct	42 ms	348 KB	Output is correct
20	Correct	12 ms	348 KB	Output is correct
21	Incorrect	34 ms	492 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #3

0 / 15.0

#	결과	실행 시간	메모리	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	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 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	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	7 ms	500 KB	Output is correct
18	Correct	18 ms	344 KB	Output is correct
19	Correct	42 ms	348 KB	Output is correct
20	Correct	12 ms	348 KB	Output is correct
21	Incorrect	34 ms	492 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #4

0 / 30.0

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

Subtask #5

0 / 20.0

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

Subtask #6

0 / 20.0

#	결과	실행 시간	메모리	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	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 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	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	7 ms	500 KB	Output is correct
18	Correct	18 ms	344 KB	Output is correct
19	Correct	42 ms	348 KB	Output is correct
20	Correct	12 ms	348 KB	Output is correct
21	Incorrect	34 ms	492 KB	Output isn't correct
22	Halted	0 ms	0 KB	-