oj.uz

답안 #620744

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
620744 2022-08-03T08:43:18 Z 반딧불(#8518) 유적 3 (JOI20_ruins3) C++17
6 / 100
 5816 ms 45484 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const ll MOD = 1000000007;

int n;
bool used[30];
int pow3[20];
bool alive[2000002][13];
ll DP[2][2000002];

inline int bit(int x, int k){
    return (x/pow3[k])%3;
}

void init(){
    pow3[0] = 1;
    for(int i=1; i<=13; i++) pow3[i] = pow3[i-1] * 3;
}

int l1[20], l2[20];
void isAble(int b){
    int rb=b;
    for(int i=0; i<n; i++){
        l1[i]=l2[i]=0;
        if(b%3) l1[i]=2;
        if(b%3==2) l2[i]=2;
        b/=3;
    }

    for(int i=0; i<n; i++){ /// i�� �õ��� ����
        int c[3]={0,0,0};
        if(l1[i] == 0) l1[i] = 1;
        else if(l2[i] == 0) l2[i] = 1;
        else continue;
        for(int j=0; j<n; j++){
            c[l1[j]]++, c[l2[j]]++;
            if(c[2]) c[2]--;
            else if(c[1]) c[1]--;
            else c[0]--;
        }
        if(c[1]) alive[rb][i] = 1;

        if(l2[i] == 1) l2[i] = 0;
        else l1[i] = 0;
    }
}

int main(){
    scanf("%d", &n);
    init();
    for(int i=1; i<=n; i++){
        int x;
        scanf("%d", &x);
        used[x] = 1;
    }

    for(int i=0; i<pow3[n]; i++){
        isAble(i);
    }

    DP[0][0] = 1;
    for(int i=1; i<=n*2; i++){ /// i: ����ġ
//        printf("i : %d\n", i);
        int b = i%2;
        for(int j=0; j<pow3[n]; j++) DP[b][j] = 0;
        for(int j=0; j<pow3[n]; j++){ /// j: ����
//            if(j%100==0) printf("j: %d\n", j);
            for(int x=0; x<n; x++){
                if(bit(j, x) == 2) continue; /// �̹� �� ��
                if(used[i] != alive[j][x]) continue;
                DP[b][j+pow3[x]] = (DP[b][j+pow3[x]] + DP[!b][j]) % MOD;
            }
        }
//        for(int j=0; j<pow3[n]; j++) printf("%d %d: %lld\n", i, j, DP[b][j]);
    }

    printf("%lld", DP[0][pow3[n]-1]);
}

Compilation message

ruins3.cpp: In function 'int main()':
ruins3.cpp:52:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
ruins3.cpp:56:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 5676 ms 45316 KB Output is correct
3 Correct 5816 ms 45424 KB Output is correct
4 Correct 36 ms 880 KB Output is correct
5 Correct 5614 ms 45420 KB Output is correct
6 Correct 5425 ms 45428 KB Output is correct
7 Correct 5459 ms 45428 KB Output is correct
8 Correct 5514 ms 45428 KB Output is correct
9 Correct 5494 ms 45484 KB Output is correct
10 Correct 5643 ms 45480 KB Output is correct

Subtask #2
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 5676 ms 45316 KB Output is correct
3 Correct 5816 ms 45424 KB Output is correct
4 Correct 36 ms 880 KB Output is correct
5 Correct 5614 ms 45420 KB Output is correct
6 Correct 5425 ms 45428 KB Output is correct
7 Correct 5459 ms 45428 KB Output is correct
8 Correct 5514 ms 45428 KB Output is correct
9 Correct 5494 ms 45484 KB Output is correct
10 Correct 5643 ms 45480 KB Output is correct
11 Runtime error 39 ms 428 KB Execution killed with signal 8
12 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 5676 ms 45316 KB Output is correct
3 Correct 5816 ms 45424 KB Output is correct
4 Correct 36 ms 880 KB Output is correct
5 Correct 5614 ms 45420 KB Output is correct
6 Correct 5425 ms 45428 KB Output is correct
7 Correct 5459 ms 45428 KB Output is correct
8 Correct 5514 ms 45428 KB Output is correct
9 Correct 5494 ms 45484 KB Output is correct
10 Correct 5643 ms 45480 KB Output is correct
11 Runtime error 39 ms 428 KB Execution killed with signal 8
12 Halted 0 ms 0 KB -