oj.uz

Submission #752700

# Submission time Handle Problem Language Result Execution time Memory
752700 2023-06-03T12:48:27 Z 이동현(#9968) L-triominoes (CEOI21_ltriominoes) C++17
10 / 100
 8000 ms 131236 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define int long long
#define mi(x, y) (x = min(x, y))
#define ma(x, y) (x = max(x, y))
using namespace std;

const int NS = 13;
int way[(1 << NS) + 4][(1 << NS) + 4];
vector<int> vway[(1 << NS) + 4];
int dist[(1 << NS) + 4];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int w, h, k;
    cin >> w >> h >> k;
    vector<pair<int, int>> a(k);
    for(int i = 0; i < k; ++i){
        cin >> a[i].first >> a[i].second;
        swap(a[i].first, a[i].second);
        --a[i].first, --a[i].second;
    }
    sort(a.begin(), a.end());

    for(int i = 0; i < (1 << w); ++i){
        auto dfs = [&](auto&&self, int x, int bt)->void{
            int now = (i >> x & 1);
            if(now){
                self(self, x + 1, bt);
                return;
            }
            if(x == w){
                way[i][bt] = 1;
                return;
            }
            int nxt = (i >> (x + 1) & 1);
            int btnow = (bt >> x & 1);

            if(x + 1 < w && !nxt && !btnow){
                self(self, x + 2, bt | 1 << x);
            }
            if(x + 1 < w && !nxt){
                self(self, x + 2, bt | 1 << (x + 1));
            }
            if(x + 1 < w && !btnow){
                self(self, x + 1, bt | 1 << x | 1 << (x + 1));
            }
            if(!btnow && x && !(bt >> (x - 1) & 1)){
                self(self, x + 1, bt | 1 << x | 1 << (x - 1));
            }
        };
        dfs(dfs, 0, 0);
        for(int j = 0; j < (1 << w); ++j){
            if(way[i][j]){
                vway[i].push_back(j);
            }
        }
    }

    vector<int> dp(1 << w);
    int p = 0, bt = 0;
    while(p < k && a[p].first == 0){
        bt |= (1 << a[p].second);
        ++p;
    }
    dp[bt] = 1;
    for(int i = 1; i < h; ++i){
        bt = 0;
        while(p < k && a[p].first == i){
            bt |= (1 << a[p].second);
            ++p;
        }
        vector<int> ndp(1 << w);
        for(int j = 0; j < (1 << w); ++j){
            if(!dp[j]) continue;
            for(auto&nxt:vway[j]){
                //cout << i << ' ' << j << ' ' << nxt << ' ' << bt << endl;
                if(!(nxt & bt)){
                    ndp[nxt | bt] = 1;
                }
            }
        }
        swap(dp, ndp);
    }

    if(dp[(1 << w) - 1]){
        cout << "YES\n";
    }
    else{
        cout << "NO\n";
    }
    
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 1048 KB Output is correct
8 Correct 61 ms 49656 KB Output is correct
9 Correct 17 ms 19284 KB Output is correct
10 Correct 3 ms 3412 KB Output is correct
11 Correct 67 ms 49680 KB Output is correct
12 Correct 8 ms 7444 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 664 KB Output is correct
15 Correct 56 ms 49612 KB Output is correct
16 Correct 347 ms 131112 KB Output is correct
17 Correct 17 ms 7548 KB Output is correct
18 Correct 125 ms 49720 KB Output is correct
19 Correct 2 ms 1108 KB Output is correct
20 Correct 360 ms 131236 KB Output is correct
21 Correct 119 ms 49716 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 2 ms 1044 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 384 ms 131216 KB Output is correct
26 Correct 380 ms 131148 KB Output is correct
27 Correct 1 ms 596 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 8006 ms 980 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 8068 ms 468 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 988 ms 572 KB Output is correct
2 Correct 1283 ms 564 KB Output is correct
3 Execution timed out 8053 ms 596 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 8060 ms 980 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 1048 KB Output is correct
8 Correct 61 ms 49656 KB Output is correct
9 Correct 17 ms 19284 KB Output is correct
10 Correct 3 ms 3412 KB Output is correct
11 Correct 67 ms 49680 KB Output is correct
12 Correct 8 ms 7444 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 664 KB Output is correct
15 Correct 56 ms 49612 KB Output is correct
16 Correct 347 ms 131112 KB Output is correct
17 Correct 17 ms 7548 KB Output is correct
18 Correct 125 ms 49720 KB Output is correct
19 Correct 2 ms 1108 KB Output is correct
20 Correct 360 ms 131236 KB Output is correct
21 Correct 119 ms 49716 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 2 ms 1044 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 384 ms 131216 KB Output is correct
26 Correct 380 ms 131148 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Execution timed out 8006 ms 980 KB Time limit exceeded
29 Halted 0 ms 0 KB -