Submission #1992041
Source Code Expand
#include <algorithm> #include <bitset> #include <complex> #include <deque> #include <exception> #include <fstream> #include <functional> #include <iomanip> #include <ios> #include <iosfwd> #include <iostream> #include <istream> #include <iterator> #include <limits> #include <list> #include <locale> #include <map> #include <memory> #include <new> #include <numeric> #include <ostream> #include <queue> #include <set> #include <sstream> #include <stack> #include <stdexcept> #include <streambuf> #include <string> #include <typeinfo> #include <utility> #include <valarray> #include <vector> #include <climits> #define rep(i, m, n) for(int i=int(m);i<int(n);i++) #define EACH(i, c) for (auto &(i): c) #define all(c) begin(c),end(c) #define EXIST(s, e) ((s).find(e)!=(s).end()) #define SORT(c) sort(begin(c),end(c)) #define pb emplace_back #define MP make_pair #define SZ(a) int((a).size()) //#define LOCAL 0 //#ifdef LOCAL //#define DEBUG(s) cout << (s) << endl //#define dump(x) cerr << #x << " = " << (x) << endl //#define BR cout << endl; //#else //#define DEBUG(s) do{}while(0) //#define dump(x) do{}while(0) //#define BR //#endif //改造 typedef long long int ll; using namespace std; #define INF (1 << 30) #define INFl (ll)5e15 #define DEBUG 0 //デバッグする時1にしてね #define dump(x) cerr << #x << " = " << (x) << endl #define MOD 1000000007 //ここから編集する vector<pair<int,int> > M; int W,H; int fanc(vector<int> vp){ vector<vector<int> > mat(W,vector<int>(H,1)); int ans = 0; rep(i,0,vp.size()){ int x = M[vp[i]].first; int y = M[vp[i]].second; // for(int j = x - 1; j <= x + 1; j++){ // if(j >= 0 && j < W && mat[j][y] == 1){ // mat[j][y] = 0; // ans++; // } // } // for(int j = y - 1; j <= y + 1; j++){ // if(j >= 0 && j < H && mat[x][j] == 1){ // mat[x][j] = 0; // ans++; // } // } if(mat[x][y]){ mat[x][y] = 0; ans++; } for(int j = x + 1; j < W; j++){ if(mat[j][y] == 1){ mat[j][y] = 0; ans++; }else{ break; } } for(int j = x - 1; j >= 0; j--){ if(mat[j][y] == 1){ mat[j][y] = 0; ans++; }else{ break; } } for(int j = y + 1; j < H; j++){ if(mat[x][j] == 1){ mat[x][j] = 0; ans++; }else{ break; } } for(int j = y - 1; j >= 0; j--){ if(mat[x][j] == 1){ mat[x][j] = 0; ans++; }else{ break; } } } // cout << "---" << endl; // rep(i,0,H){ // rep(j,0,W){ // cout << mat[i][j]; // } // cout << endl; // } return ans; } int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> W >> H; int N; cin >> N; vector<int> vp; if(N > 10){ cout << "aaa" << endl; return 0; } rep(i,0,N){ vp.push_back(i); int x,y; cin >> x >> y; x--; y--; M.emplace_back(x,y); } int ans = 0; do{ ans = max(ans,fanc(vp)); }while(next_permutation(all(vp))); cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 金塊ゲーム |
User | homesentinel |
Language | C++14 (Clang 3.8.0) |
Score | 80 |
Code Size | 3659 Byte |
Status | RE |
Exec Time | 4203 ms |
Memory | 2152 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | ||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 80 / 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 | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 38 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 26 ms | 256 KB |
subtask1_04.txt | AC | 53 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 | 2 ms | 256 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | AC | 2 ms | 256 KB |
subtask1_13.txt | AC | 5 ms | 256 KB |
subtask1_14.txt | AC | 5 ms | 256 KB |
subtask1_15.txt | AC | 219 ms | 256 KB |
subtask1_16.txt | AC | 87 ms | 256 KB |
subtask1_17.txt | AC | 125 ms | 256 KB |
subtask1_18.txt | AC | 33 ms | 256 KB |
subtask1_19.txt | AC | 25 ms | 256 KB |
subtask1_20.txt | AC | 25 ms | 256 KB |
subtask1_21.txt | AC | 119 ms | 256 KB |
subtask1_22.txt | AC | 93 ms | 256 KB |
subtask1_23.txt | AC | 43 ms | 256 KB |
subtask1_24.txt | AC | 193 ms | 256 KB |
subtask1_25.txt | AC | 224 ms | 256 KB |
subtask2_01.txt | WA | 1 ms | 256 KB |
subtask2_02.txt | WA | 1 ms | 256 KB |
subtask2_03.txt | WA | 1 ms | 256 KB |
subtask2_04.txt | WA | 1 ms | 256 KB |
subtask2_05.txt | WA | 1 ms | 256 KB |
subtask2_06.txt | WA | 1 ms | 256 KB |
subtask2_07.txt | WA | 1 ms | 256 KB |
subtask2_08.txt | WA | 1 ms | 256 KB |
subtask2_09.txt | WA | 1 ms | 256 KB |
subtask2_10.txt | WA | 1 ms | 256 KB |
subtask2_11.txt | WA | 1 ms | 256 KB |
subtask2_12.txt | WA | 1 ms | 256 KB |
subtask2_13.txt | WA | 1 ms | 256 KB |
subtask2_14.txt | WA | 1 ms | 256 KB |
subtask2_15.txt | TLE | 4203 ms | 256 KB |
subtask2_16.txt | WA | 1 ms | 256 KB |
subtask2_17.txt | WA | 1 ms | 256 KB |
subtask2_18.txt | WA | 1 ms | 256 KB |
subtask2_19.txt | WA | 1 ms | 256 KB |
subtask2_20.txt | WA | 1 ms | 256 KB |
subtask2_21.txt | WA | 1 ms | 256 KB |
subtask2_22.txt | WA | 1 ms | 256 KB |
subtask2_23.txt | WA | 1 ms | 256 KB |
subtask2_24.txt | WA | 1 ms | 256 KB |
subtask2_25.txt | WA | 1 ms | 256 KB |
subtask3_01.txt | RE | 2368 ms | -693176 KB |
subtask3_02.txt | WA | 26 ms | 2152 KB |
subtask3_03.txt | WA | 1 ms | 256 KB |
subtask3_04.txt | WA | 1 ms | 256 KB |
subtask3_05.txt | WA | 1 ms | 256 KB |
subtask3_06.txt | WA | 1 ms | 256 KB |
subtask3_07.txt | WA | 1 ms | 256 KB |
subtask3_08.txt | WA | 1 ms | 256 KB |
subtask3_09.txt | WA | 1 ms | 256 KB |
subtask3_10.txt | WA | 1 ms | 256 KB |
subtask3_11.txt | WA | 1 ms | 256 KB |
subtask3_12.txt | WA | 1 ms | 256 KB |
subtask3_13.txt | WA | 1 ms | 256 KB |
subtask3_14.txt | WA | 1 ms | 256 KB |
subtask3_15.txt | WA | 1 ms | 256 KB |
subtask3_16.txt | WA | 1 ms | 256 KB |
subtask3_17.txt | WA | 1 ms | 256 KB |
subtask3_18.txt | WA | 1 ms | 256 KB |
subtask3_19.txt | WA | 1 ms | 256 KB |
subtask3_20.txt | WA | 1 ms | 256 KB |
subtask3_21.txt | WA | 1 ms | 256 KB |
subtask3_22.txt | WA | 1 ms | 256 KB |
subtask3_23.txt | WA | 1 ms | 256 KB |
subtask3_24.txt | WA | 1 ms | 256 KB |
subtask3_25.txt | WA | 1 ms | 256 KB |