Submission #1696404
Source Code Expand
#include <algorithm> #include <cstdio> #include <iostream> #include <map> #include <cmath> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <vector> #include <stdlib.h> #include <stdio.h> #include <bitset> #include <cstring> using namespace std; #define FOR(I,A,B) for(int I = (A); I < (B); ++I) #define CLR(mat) memset(mat, 0, sizeof(mat)) typedef long long ll; typedef pair<int, int> P; typedef pair<P, P> PP; int W, H, N; vector<P> v(30); map<PP, ll> MAP; ll dfs(int x1, int y1, int x2, int y2) { if(MAP.count(PP(P(x1,y1),P(x2,y2)))) return MAP[PP(P(x1,y1),P(x2,y2))]; ll ret = 0; FOR(i,0,N) { int X = v[i].first; int Y = v[i].second; ll tmp = 0; if(X >= x1 && X <= x2 && Y >= y1 && Y <= y2) { tmp = y2 - y1 + x2 - x1 + 1; tmp += dfs(x1,Y+1,X-1,y2); // 左上 tmp += dfs(X+1,Y+1,x2,y2); // 右上 tmp += dfs(x1,y1,X-1,Y-1); // 左下 tmp += dfs(X+1,y1,x2,Y-1); // 右下 } ret = max(ret, tmp); } MAP[PP(P(x1,y1), P(x2,y2))] = ret; return ret; } int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> W >> H >> N; FOR(i,0,N) { int x, y; cin >> x >> y; v[i] = P(x, y); } cout << dfs(1,1,W,H) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 金塊ゲーム |
User | nenuon |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1308 Byte |
Status | AC |
Exec Time | 23 ms |
Memory | 896 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 80 / 80 | 19 / 19 | 1 / 1 | ||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
Subtask1 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt |
Subtask2 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt |
Subtask3 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask3_01.txt, subtask3_02.txt, subtask3_03.txt, subtask3_04.txt, subtask3_05.txt, subtask3_06.txt, subtask3_07.txt, subtask3_08.txt, subtask3_09.txt, subtask3_10.txt, subtask3_11.txt, subtask3_12.txt, subtask3_13.txt, subtask3_14.txt, subtask3_15.txt, subtask3_16.txt, subtask3_17.txt, subtask3_18.txt, subtask3_19.txt, subtask3_20.txt, subtask3_21.txt, subtask3_22.txt, subtask3_23.txt, subtask3_24.txt, subtask3_25.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 2 ms | 512 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | AC | 1 ms | 256 KB |
subtask1_05.txt | AC | 1 ms | 256 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | AC | 1 ms | 256 KB |
subtask1_13.txt | AC | 1 ms | 256 KB |
subtask1_14.txt | AC | 1 ms | 256 KB |
subtask1_15.txt | AC | 1 ms | 256 KB |
subtask1_16.txt | AC | 1 ms | 256 KB |
subtask1_17.txt | AC | 1 ms | 256 KB |
subtask1_18.txt | AC | 1 ms | 256 KB |
subtask1_19.txt | AC | 1 ms | 256 KB |
subtask1_20.txt | AC | 1 ms | 256 KB |
subtask1_21.txt | AC | 1 ms | 256 KB |
subtask1_22.txt | AC | 1 ms | 256 KB |
subtask1_23.txt | AC | 1 ms | 256 KB |
subtask1_24.txt | AC | 1 ms | 256 KB |
subtask1_25.txt | AC | 1 ms | 256 KB |
subtask2_01.txt | AC | 3 ms | 384 KB |
subtask2_02.txt | AC | 3 ms | 384 KB |
subtask2_03.txt | AC | 8 ms | 512 KB |
subtask2_04.txt | AC | 5 ms | 512 KB |
subtask2_05.txt | AC | 8 ms | 512 KB |
subtask2_06.txt | AC | 11 ms | 640 KB |
subtask2_07.txt | AC | 11 ms | 640 KB |
subtask2_08.txt | AC | 11 ms | 640 KB |
subtask2_09.txt | AC | 21 ms | 896 KB |
subtask2_10.txt | AC | 21 ms | 896 KB |
subtask2_11.txt | AC | 21 ms | 896 KB |
subtask2_12.txt | AC | 22 ms | 896 KB |
subtask2_13.txt | AC | 11 ms | 640 KB |
subtask2_14.txt | AC | 11 ms | 640 KB |
subtask2_15.txt | AC | 2 ms | 256 KB |
subtask2_16.txt | AC | 11 ms | 640 KB |
subtask2_17.txt | AC | 22 ms | 896 KB |
subtask2_18.txt | AC | 22 ms | 896 KB |
subtask2_19.txt | AC | 21 ms | 896 KB |
subtask2_20.txt | AC | 21 ms | 896 KB |
subtask2_21.txt | AC | 22 ms | 896 KB |
subtask2_22.txt | AC | 21 ms | 896 KB |
subtask2_23.txt | AC | 21 ms | 896 KB |
subtask2_24.txt | AC | 21 ms | 896 KB |
subtask2_25.txt | AC | 23 ms | 896 KB |
subtask3_01.txt | AC | 1 ms | 256 KB |
subtask3_02.txt | AC | 3 ms | 384 KB |
subtask3_03.txt | AC | 3 ms | 384 KB |
subtask3_04.txt | AC | 4 ms | 384 KB |
subtask3_05.txt | AC | 7 ms | 512 KB |
subtask3_06.txt | AC | 5 ms | 512 KB |
subtask3_07.txt | AC | 5 ms | 512 KB |
subtask3_08.txt | AC | 11 ms | 640 KB |
subtask3_09.txt | AC | 12 ms | 640 KB |
subtask3_10.txt | AC | 22 ms | 896 KB |
subtask3_11.txt | AC | 20 ms | 896 KB |
subtask3_12.txt | AC | 23 ms | 896 KB |
subtask3_13.txt | AC | 22 ms | 896 KB |
subtask3_14.txt | AC | 21 ms | 896 KB |
subtask3_15.txt | AC | 21 ms | 896 KB |
subtask3_16.txt | AC | 20 ms | 896 KB |
subtask3_17.txt | AC | 22 ms | 896 KB |
subtask3_18.txt | AC | 8 ms | 512 KB |
subtask3_19.txt | AC | 20 ms | 896 KB |
subtask3_20.txt | AC | 11 ms | 640 KB |
subtask3_21.txt | AC | 23 ms | 896 KB |
subtask3_22.txt | AC | 22 ms | 896 KB |
subtask3_23.txt | AC | 21 ms | 896 KB |
subtask3_24.txt | AC | 21 ms | 896 KB |
subtask3_25.txt | AC | 20 ms | 896 KB |