Submission #1679855


Source Code Expand

#define FOR(i,j,n) for (int i=(j);i<(n);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define I(n) scanf("%d", &(n))
#include <bits/stdc++.h>
using namespace std;
int table[26],dp[1<<25],tmp,x,y,bits;

int main(){
    REP(i,25){ I(tmp); table[tmp] = i;}

    dp[0] = 1;
    REP(i,1<<25){
        if (!dp[i]) continue;
        bits = 1;
        tmp = i;
        while(tmp) { tmp &= tmp-1; bits++;}
        REP(distr,25){
            if (table[bits] != 0 && table[bits] != distr) continue;
            if ((1<<distr) & i) continue;
            x = distr % 5;
            y = distr / 5;
            if ((x == 0 || x == 4 || !((((1<<(distr-1)) & i)!=0) ^ (((1<<(distr+1)) & i)!=0))) &&
                (y == 0 || y == 4 || !((((1<<(distr-5)) & i)!=0) ^ (((1<<(distr+5)) & i)!=0)))){
                dp[i | (1<<distr)] += dp[i];
                dp[i | (1<<distr)] %= 1000000007;
            }
        }
    }
    printf("%d\n",dp[(1<<25)-1]);
}

Submission Info

Submission Time
Task D - 25個の整数
User omi
Language C++14 (GCC 5.4.1)
Score 0
Code Size 968 Byte
Status WA
Exec Time 312 ms
Memory 118528 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:9:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     REP(i,25){ I(tmp); table[tmp] = i;}
                      ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 3
WA × 1
AC × 12
WA × 7
AC × 19
WA × 10
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
Subtask1 sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, test-1-01.txt, test-1-02.txt, test-1-03.txt, test-1-04.txt, test-1-05.txt, test-1-06.txt, test-1-07.txt, test-1-08.txt, test-1-09.txt, test-1-10.txt, test-1-11.txt, test-1-12.txt, test-1-13.txt, test-1-14.txt, test-1-15.txt
Subtask2 sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, test-1-01.txt, test-1-02.txt, test-1-03.txt, test-1-04.txt, test-1-05.txt, test-1-06.txt, test-1-07.txt, test-1-08.txt, test-1-09.txt, test-1-10.txt, test-1-11.txt, test-1-12.txt, test-1-13.txt, test-1-14.txt, test-1-15.txt, test-2-01.txt, test-2-02.txt, test-2-03.txt, test-2-04.txt, test-2-05.txt, test-2-06.txt, test-2-07.txt, test-2-08.txt, test-2-09.txt, test-2-10.txt
Case Name Status Exec Time Memory
sample-01.txt AC 40 ms 24832 KB
sample-02.txt WA 179 ms 116352 KB
sample-03.txt AC 37 ms 12544 KB
sample-04.txt AC 39 ms 24960 KB
test-1-01.txt AC 43 ms 39296 KB
test-1-02.txt WA 47 ms 57728 KB
test-1-03.txt WA 41 ms 30976 KB
test-1-04.txt WA 59 ms 113024 KB
test-1-05.txt WA 46 ms 49408 KB
test-1-06.txt AC 55 ms 90496 KB
test-1-07.txt AC 35 ms 2304 KB
test-1-08.txt AC 55 ms 94720 KB
test-1-09.txt WA 55 ms 90496 KB
test-1-10.txt AC 37 ms 14592 KB
test-1-11.txt AC 40 ms 24832 KB
test-1-12.txt AC 57 ms 100992 KB
test-1-13.txt WA 38 ms 18688 KB
test-1-14.txt AC 44 ms 41216 KB
test-1-15.txt AC 48 ms 61824 KB
test-2-01.txt AC 53 ms 47360 KB
test-2-02.txt AC 92 ms 113408 KB
test-2-03.txt WA 47 ms 45312 KB
test-2-04.txt WA 70 ms 117760 KB
test-2-05.txt AC 144 ms 113920 KB
test-2-06.txt AC 312 ms 113664 KB
test-2-07.txt WA 162 ms 92416 KB
test-2-08.txt AC 218 ms 115968 KB
test-2-09.txt AC 286 ms 118528 KB
test-2-10.txt AC 297 ms 103040 KB