Submission #169630


Source Code Expand

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define For(i,x) for (int i=0; i<(int)(x); i++)

typedef vector<int> vi;

const int N = 90;

int calc(int w, int h, vector<pair<int, int> >& v) {
    const int n = v.size();
    vi iv;
    For(i, n) iv.push_back(i);

    int best = 0;
    do {
        bool visited[N][N] = {};
        int cnt = 0;

        For(i, n) {
            int x = v[iv[i]].first;
            int y = v[iv[i]].second;

            if (visited[x][y]) continue;

            int ds[][2] = { { 0, 1 }, { 0, -1 }, { 1, 0 }, { -1, 0 } };
            For(j, 4) {
                int dx = ds[j][0];
                int dy = ds[j][1];

                int xx = x + dx;
                int yy = y + dy;
                while (0 <= xx && xx < w && 0 <= yy && yy < h) {
                    if (!visited[xx][yy]) {
                        visited[xx][yy] = true;
                        cnt++;
                    }
                    else break;
                    xx += dx;
                    yy += dy;
                }
            }

            // (x, y) itself
            visited[x][y] = true;
            cnt++;
        }
        best = max(best, cnt);

    } while (next_permutation(iv.begin(), iv.end()));

    return best;
}

int main() {
    int w, h;
    scanf("%d %d", &w, &h);

    int n;
    scanf("%d", &n);
    vector<pair<int, int> > v;
    For(i, n) {
        int x, y;
        scanf("%d %d", &x, &y);
        v.push_back(make_pair(x-1, y-1));
    }

    printf("%d\n", calc(w, h, v));
}

Submission Info

Submission Time
Task D - 金塊ゲーム
User noriok
Language C++ (G++ 4.6.4)
Score 80
Code Size 1642 Byte
Status TLE
Exec Time 4037 ms
Memory 940 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:59:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:62:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:66:31: 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 80 / 80 0 / 19 0 / 1
Status
AC × 3
AC × 25
AC × 25
TLE × 25
AC × 25
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 22 ms 928 KB
sample_02.txt AC 21 ms 932 KB
sample_03.txt AC 58 ms 812 KB
subtask1_01.txt AC 20 ms 784 KB
subtask1_02.txt AC 22 ms 928 KB
subtask1_03.txt AC 51 ms 812 KB
subtask1_04.txt AC 80 ms 800 KB
subtask1_05.txt AC 22 ms 924 KB
subtask1_06.txt AC 21 ms 732 KB
subtask1_07.txt AC 21 ms 924 KB
subtask1_08.txt AC 20 ms 792 KB
subtask1_09.txt AC 22 ms 800 KB
subtask1_10.txt AC 20 ms 732 KB
subtask1_11.txt AC 20 ms 920 KB
subtask1_12.txt AC 21 ms 924 KB
subtask1_13.txt AC 23 ms 808 KB
subtask1_14.txt AC 23 ms 800 KB
subtask1_15.txt AC 155 ms 800 KB
subtask1_16.txt AC 94 ms 924 KB
subtask1_17.txt AC 100 ms 800 KB
subtask1_18.txt AC 67 ms 800 KB
subtask1_19.txt AC 49 ms 804 KB
subtask1_20.txt AC 49 ms 808 KB
subtask1_21.txt AC 103 ms 936 KB
subtask1_22.txt AC 129 ms 924 KB
subtask1_23.txt AC 75 ms 812 KB
subtask1_24.txt AC 154 ms 920 KB
subtask1_25.txt AC 167 ms 796 KB
subtask2_01.txt TLE 4030 ms 932 KB
subtask2_02.txt TLE 4029 ms 928 KB
subtask2_03.txt TLE 4029 ms 808 KB
subtask2_04.txt TLE 4029 ms 808 KB
subtask2_05.txt TLE 4033 ms 864 KB
subtask2_06.txt TLE 4030 ms 880 KB
subtask2_07.txt TLE 4030 ms 932 KB
subtask2_08.txt TLE 4029 ms 884 KB
subtask2_09.txt TLE 4029 ms 808 KB
subtask2_10.txt TLE 4030 ms 816 KB
subtask2_11.txt TLE 4029 ms 872 KB
subtask2_12.txt TLE 4030 ms 932 KB
subtask2_13.txt TLE 4029 ms 808 KB
subtask2_14.txt TLE 4030 ms 872 KB
subtask2_15.txt TLE 4033 ms 884 KB
subtask2_16.txt TLE 4029 ms 936 KB
subtask2_17.txt TLE 4029 ms 812 KB
subtask2_18.txt TLE 4029 ms 932 KB
subtask2_19.txt TLE 4029 ms 808 KB
subtask2_20.txt TLE 4029 ms 812 KB
subtask2_21.txt TLE 4037 ms 920 KB
subtask2_22.txt TLE 4029 ms 804 KB
subtask2_23.txt TLE 4029 ms 808 KB
subtask2_24.txt TLE 4029 ms 940 KB
subtask2_25.txt TLE 4029 ms 928 KB
subtask3_01.txt RE 375 ms 800 KB
subtask3_02.txt RE 247 ms 924 KB
subtask3_03.txt RE 243 ms 928 KB
subtask3_04.txt RE 256 ms 796 KB
subtask3_05.txt RE 248 ms 796 KB
subtask3_06.txt RE 255 ms 804 KB
subtask3_07.txt RE 269 ms 804 KB
subtask3_08.txt RE 257 ms 928 KB
subtask3_09.txt RE 263 ms 788 KB
subtask3_10.txt RE 246 ms 676 KB
subtask3_11.txt RE 256 ms 924 KB
subtask3_12.txt RE 258 ms 920 KB
subtask3_13.txt RE 274 ms 800 KB
subtask3_14.txt RE 262 ms 800 KB
subtask3_15.txt RE 267 ms 924 KB
subtask3_16.txt RE 273 ms 920 KB
subtask3_17.txt RE 259 ms 924 KB
subtask3_18.txt RE 265 ms 928 KB
subtask3_19.txt RE 261 ms 800 KB
subtask3_20.txt RE 262 ms 928 KB
subtask3_21.txt RE 257 ms 928 KB
subtask3_22.txt RE 255 ms 924 KB
subtask3_23.txt RE 249 ms 804 KB
subtask3_24.txt RE 258 ms 796 KB
subtask3_25.txt RE 251 ms 800 KB