Submission #1174543
Source Code Expand
#include <bits/stdc++.h> using namespace std; char stage[501][501]; int n; int countblackcol(){ int res=0; for (int x = 0; x < n; ++x) { int y; for (y = 0; y < n; ++y) { if(stage[y][x]=='.') break; } if(y==n) res++; } return res; } int searchrow(){ //黒一行を作るまでの回数の最小を調べる int minv = n+1; for (int y = 0; y < n; ++y) { int v = 0; int ty; //塗りつぶし開始までの準備 for (ty = 0; ty < n; ++ty) { if(stage[ty][y]=='#') break; } if(ty == n) v=1; //塗りつぶす個数 for (int x = 0; x < n; ++x) { if(stage[y][x]=='.') v++; } //行動回数が最小のものを残す if(minv > v){ minv = v; } } return minv; } int main(){ // freopen("in.txt","r",stdin); cin >> n; for (int i = 0; i < n; ++i) { scanf("%s",stage[i]); } //どこに張り付けたとしても縦一列にはならない //つまり初めに縦一列黒なものから増えない int ans = searchrow(); if(ans==n+1){ cout << "-1" << endl; return 0; } //縦一列黒ではない個数を調べる ans += n - countblackcol(); cout << ans << endl; //横一列すべて黒にするまでにかかる最小試行数 return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Row to Column |
User | ajinori |
Language | C++14 (GCC 5.4.1) |
Score | 1300 |
Code Size | 1284 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 512 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:49:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s",stage[i]); ^
Judge Result
Set Name | Sample | Subtask | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | 1000 / 1000 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
Subtask | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt, 2_16.txt, 2_17.txt, 2_18.txt, 2_19.txt, 2_20.txt, 2_21.txt, 2_22.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 1 ms | 256 KB |
0_04.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | AC | 1 ms | 256 KB |
1_04.txt | AC | 1 ms | 256 KB |
1_05.txt | AC | 1 ms | 256 KB |
1_06.txt | AC | 1 ms | 256 KB |
1_07.txt | AC | 1 ms | 256 KB |
1_08.txt | AC | 1 ms | 256 KB |
1_09.txt | AC | 1 ms | 256 KB |
1_10.txt | AC | 1 ms | 256 KB |
1_11.txt | AC | 1 ms | 256 KB |
1_12.txt | AC | 1 ms | 256 KB |
1_13.txt | AC | 1 ms | 256 KB |
1_14.txt | AC | 1 ms | 256 KB |
2_00.txt | AC | 2 ms | 512 KB |
2_01.txt | AC | 2 ms | 512 KB |
2_02.txt | AC | 2 ms | 512 KB |
2_03.txt | AC | 2 ms | 512 KB |
2_04.txt | AC | 2 ms | 512 KB |
2_05.txt | AC | 2 ms | 512 KB |
2_06.txt | AC | 2 ms | 512 KB |
2_07.txt | AC | 2 ms | 384 KB |
2_08.txt | AC | 2 ms | 512 KB |
2_09.txt | AC | 2 ms | 512 KB |
2_10.txt | AC | 2 ms | 512 KB |
2_11.txt | AC | 2 ms | 512 KB |
2_12.txt | AC | 2 ms | 512 KB |
2_13.txt | AC | 2 ms | 512 KB |
2_14.txt | AC | 2 ms | 512 KB |
2_15.txt | AC | 2 ms | 512 KB |
2_16.txt | AC | 2 ms | 512 KB |
2_17.txt | AC | 2 ms | 512 KB |
2_18.txt | AC | 2 ms | 384 KB |
2_19.txt | AC | 2 ms | 512 KB |
2_20.txt | AC | 2 ms | 384 KB |
2_21.txt | AC | 2 ms | 384 KB |
2_22.txt | AC | 2 ms | 512 KB |