Submission #169667


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>

#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define between(a,x,b) ((a)<=(x)&&(x)<=(b))
using namespace std;

int board[100][100];
int W, H;
int dx[] = {0,-1,0,1}, dy[] = {-1,0,1,0};

void dfs(int y, int x, int i){
  board[y][x] = 0;
  int ny = y + dy[i], nx = x + dx[i];
  if(board[ny][nx] == 1) dfs(ny, nx, i);
  return;
}

int main(){
  scanf("%d%d", &W, &H);
  int N, x, y, res =0;
  scanf("%d", &N);
  vector<pair<int, int> >p(N);

  rep(i, N){
    scanf("%d%d", &x, &y);
    p[i] = make_pair(x, y);
  }
  //  puts("in");
  do{
    REP(i, 1, W+1) REP(j, 1, H+1) board[i][j] = 1;
    rep(i, N){
      rep(j, 4){
	dfs(p[i].first, p[i].second, j);
      }
    }
    int c = 0;
    REP(i, 1, W+1){
      REP(j, 1, H+1){
	//	printf("%d ", (int)board[i][j]);
	if(!board[i][j]) c++;
      }
      //      puts("");
    }
    res = max(res, c);
  }while(next_permutation(p.begin(), p.end())); 

  printf("%d\n", res);

  return 0;
}

Submission Info

Submission Time
Task D - 金塊ゲーム
User raven38
Language C++ (G++ 4.6.4)
Score 0
Code Size 1227 Byte
Status WA
Exec Time 4033 ms
Memory 944 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:30:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:32:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:36:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 0 / 80 0 / 19 0 / 1
Status
AC × 2
WA × 1
AC × 11
WA × 14
AC × 11
WA × 14
TLE × 25
AC × 11
WA × 14
TLE × 25
RE × 25
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 20 ms 928 KB
sample_02.txt AC 21 ms 800 KB
sample_03.txt WA 32 ms 812 KB
subtask1_01.txt AC 19 ms 920 KB
subtask1_02.txt WA 20 ms 920 KB
subtask1_03.txt AC 41 ms 672 KB
subtask1_04.txt AC 105 ms 924 KB
subtask1_05.txt WA 21 ms 808 KB
subtask1_06.txt AC 21 ms 800 KB
subtask1_07.txt WA 21 ms 928 KB
subtask1_08.txt AC 21 ms 928 KB
subtask1_09.txt WA 22 ms 736 KB
subtask1_10.txt WA 21 ms 928 KB
subtask1_11.txt AC 21 ms 808 KB
subtask1_12.txt WA 20 ms 924 KB
subtask1_13.txt AC 21 ms 800 KB
subtask1_14.txt AC 34 ms 932 KB
subtask1_15.txt WA 366 ms 800 KB
subtask1_16.txt WA 30 ms 928 KB
subtask1_17.txt AC 172 ms 928 KB
subtask1_18.txt AC 63 ms 740 KB
subtask1_19.txt WA 28 ms 764 KB
subtask1_20.txt AC 36 ms 796 KB
subtask1_21.txt WA 37 ms 928 KB
subtask1_22.txt WA 110 ms 804 KB
subtask1_23.txt WA 60 ms 920 KB
subtask1_24.txt WA 137 ms 756 KB
subtask1_25.txt WA 220 ms 928 KB
subtask2_01.txt TLE 4029 ms 804 KB
subtask2_02.txt TLE 4029 ms 808 KB
subtask2_03.txt TLE 4031 ms 940 KB
subtask2_04.txt TLE 4030 ms 932 KB
subtask2_05.txt TLE 4029 ms 932 KB
subtask2_06.txt TLE 4033 ms 884 KB
subtask2_07.txt TLE 4029 ms 932 KB
subtask2_08.txt TLE 4028 ms 816 KB
subtask2_09.txt TLE 4030 ms 864 KB
subtask2_10.txt TLE 4029 ms 932 KB
subtask2_11.txt TLE 4029 ms 944 KB
subtask2_12.txt TLE 4030 ms 940 KB
subtask2_13.txt TLE 4028 ms 928 KB
subtask2_14.txt TLE 4029 ms 936 KB
subtask2_15.txt TLE 4028 ms 924 KB
subtask2_16.txt TLE 4028 ms 936 KB
subtask2_17.txt TLE 4029 ms 936 KB
subtask2_18.txt TLE 4029 ms 924 KB
subtask2_19.txt TLE 4029 ms 936 KB
subtask2_20.txt TLE 4029 ms 936 KB
subtask2_21.txt TLE 4028 ms 932 KB
subtask2_22.txt TLE 4029 ms 936 KB
subtask2_23.txt TLE 4030 ms 928 KB
subtask2_24.txt TLE 4029 ms 936 KB
subtask2_25.txt TLE 4028 ms 928 KB
subtask3_01.txt RE 384 ms 928 KB
subtask3_02.txt RE 252 ms 928 KB
subtask3_03.txt RE 246 ms 932 KB
subtask3_04.txt RE 241 ms 932 KB
subtask3_05.txt RE 250 ms 800 KB
subtask3_06.txt RE 245 ms 928 KB
subtask3_07.txt RE 254 ms 928 KB
subtask3_08.txt RE 248 ms 800 KB
subtask3_09.txt RE 251 ms 800 KB
subtask3_10.txt RE 243 ms 804 KB
subtask3_11.txt RE 246 ms 928 KB
subtask3_12.txt RE 250 ms 760 KB
subtask3_13.txt RE 251 ms 800 KB
subtask3_14.txt RE 246 ms 920 KB
subtask3_15.txt RE 247 ms 928 KB
subtask3_16.txt RE 246 ms 928 KB
subtask3_17.txt RE 247 ms 796 KB
subtask3_18.txt RE 240 ms 928 KB
subtask3_19.txt RE 249 ms 796 KB
subtask3_20.txt RE 239 ms 924 KB
subtask3_21.txt RE 259 ms 800 KB
subtask3_22.txt RE 246 ms 804 KB
subtask3_23.txt RE 246 ms 812 KB
subtask3_24.txt RE 251 ms 804 KB
subtask3_25.txt RE 247 ms 924 KB