Submission #1992445
Source Code Expand
#include <iostream> #include <cstring> #include <cstdlib> #include <cmath> #include <algorithm> #include <functional> #include <vector> #include <queue> #include <stack> #include <map> #include <set> #include <bitset> #include <cassert> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector<int> vi; typedef vector<ll> vll; typedef pair<int,int> P; #define rep(i,a,n) for(ll i = (a);i < (n);i++) #define per(i,a,n) for(ll i = (a);i > (n);i--) #define lep(i,a,n) for(ll i = (a);i <= (n);i++) #define pel(i,a,n) for(ll i = (a);i >= (n);i--) #define clr(a,b) memset((a),(b),sizeof(a)) #define pb push_back #define mp make_pair #define all(c) (c).begin(),(c).end() #define sz size() #define print(X) cout << (X) << endl const ll INF = 1e+9+7; ll n,m,l; string s,t; ll d[100000],dp[100][100]; int mo[4] = {-1,-1,1,1}; void dfs(int x,int y,int t){ if(x <= 0 || y <= 0 || x > m || y > n)return; if(dp[y][x] == 0){ l++; dp[y][x] = 2; }else{ return; } if(t == 1){ dfs(x - 1,y,t-1); dfs(x + 1,y,t-1); dfs(x,y + 1,t-2); dfs(x,y - 1,t-2); }else if(t == -1){ dfs(x,y + 1,t); dfs(x,y - 1,t); }else{ dfs(x - 1,y,t); dfs(x + 1,y,t); } } int main(){ int p; cin >> n >> m; cin >> p; clr(dp,0); rep(i,0,p){ int a,b; cin >> a >> b; dfs(b,a,1); } print(l); lep(i,0,m+1){ lep(j,0,n+1){ cout << dp[i][j]; } puts(""); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 金塊ゲーム |
User | shadowlink_0122 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1532 Byte |
Status | RE |
Exec Time | 100 ms |
Memory | 3968 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 80 | 0 / 19 | 0 / 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 | WA | 1 ms | 384 KB |
sample_02.txt | WA | 1 ms | 384 KB |
sample_03.txt | WA | 1 ms | 384 KB |
subtask1_01.txt | WA | 1 ms | 384 KB |
subtask1_02.txt | WA | 1 ms | 384 KB |
subtask1_03.txt | WA | 1 ms | 384 KB |
subtask1_04.txt | WA | 1 ms | 384 KB |
subtask1_05.txt | WA | 1 ms | 384 KB |
subtask1_06.txt | WA | 1 ms | 384 KB |
subtask1_07.txt | WA | 1 ms | 384 KB |
subtask1_08.txt | WA | 1 ms | 384 KB |
subtask1_09.txt | WA | 1 ms | 384 KB |
subtask1_10.txt | WA | 2 ms | 384 KB |
subtask1_11.txt | WA | 1 ms | 384 KB |
subtask1_12.txt | WA | 2 ms | 384 KB |
subtask1_13.txt | WA | 1 ms | 384 KB |
subtask1_14.txt | WA | 1 ms | 384 KB |
subtask1_15.txt | WA | 1 ms | 384 KB |
subtask1_16.txt | WA | 1 ms | 384 KB |
subtask1_17.txt | WA | 1 ms | 384 KB |
subtask1_18.txt | WA | 1 ms | 384 KB |
subtask1_19.txt | WA | 1 ms | 384 KB |
subtask1_20.txt | WA | 1 ms | 384 KB |
subtask1_21.txt | WA | 1 ms | 384 KB |
subtask1_22.txt | WA | 1 ms | 384 KB |
subtask1_23.txt | WA | 1 ms | 384 KB |
subtask1_24.txt | WA | 1 ms | 384 KB |
subtask1_25.txt | WA | 1 ms | 384 KB |
subtask2_01.txt | WA | 1 ms | 384 KB |
subtask2_02.txt | WA | 1 ms | 384 KB |
subtask2_03.txt | WA | 1 ms | 384 KB |
subtask2_04.txt | WA | 1 ms | 384 KB |
subtask2_05.txt | WA | 1 ms | 384 KB |
subtask2_06.txt | WA | 1 ms | 384 KB |
subtask2_07.txt | WA | 1 ms | 384 KB |
subtask2_08.txt | WA | 1 ms | 384 KB |
subtask2_09.txt | WA | 1 ms | 384 KB |
subtask2_10.txt | WA | 1 ms | 384 KB |
subtask2_11.txt | WA | 1 ms | 384 KB |
subtask2_12.txt | WA | 1 ms | 384 KB |
subtask2_13.txt | WA | 1 ms | 384 KB |
subtask2_14.txt | WA | 1 ms | 384 KB |
subtask2_15.txt | WA | 1 ms | 384 KB |
subtask2_16.txt | WA | 1 ms | 384 KB |
subtask2_17.txt | WA | 1 ms | 384 KB |
subtask2_18.txt | WA | 1 ms | 384 KB |
subtask2_19.txt | WA | 1 ms | 384 KB |
subtask2_20.txt | WA | 2 ms | 384 KB |
subtask2_21.txt | WA | 1 ms | 384 KB |
subtask2_22.txt | WA | 1 ms | 384 KB |
subtask2_23.txt | WA | 1 ms | 384 KB |
subtask2_24.txt | WA | 2 ms | 384 KB |
subtask2_25.txt | WA | 2 ms | 384 KB |
subtask3_01.txt | RE | 96 ms | 256 KB |
subtask3_02.txt | RE | 97 ms | 256 KB |
subtask3_03.txt | RE | 100 ms | 3968 KB |
subtask3_04.txt | WA | 3 ms | 384 KB |
subtask3_05.txt | WA | 7 ms | 640 KB |
subtask3_06.txt | RE | 96 ms | 256 KB |
subtask3_07.txt | RE | 96 ms | 256 KB |
subtask3_08.txt | RE | 99 ms | 256 KB |
subtask3_09.txt | RE | 97 ms | 256 KB |
subtask3_10.txt | RE | 97 ms | 256 KB |
subtask3_11.txt | RE | 97 ms | 256 KB |
subtask3_12.txt | RE | 97 ms | 512 KB |
subtask3_13.txt | RE | 97 ms | 256 KB |
subtask3_14.txt | RE | 96 ms | 256 KB |
subtask3_15.txt | RE | 97 ms | 256 KB |
subtask3_16.txt | RE | 96 ms | 256 KB |
subtask3_17.txt | RE | 97 ms | 256 KB |
subtask3_18.txt | RE | 97 ms | 256 KB |
subtask3_19.txt | RE | 97 ms | 256 KB |
subtask3_20.txt | RE | 97 ms | 256 KB |
subtask3_21.txt | RE | 97 ms | 256 KB |
subtask3_22.txt | RE | 97 ms | 256 KB |
subtask3_23.txt | RE | 97 ms | 256 KB |
subtask3_24.txt | RE | 99 ms | 256 KB |
subtask3_25.txt | RE | 97 ms | 256 KB |