oj.uz

답안 #988310

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988310 2024-05-24T13:06:38 Z steveonalex Dango Maker (JOI18_dango_maker) C++17
100 / 100
 107 ms 51172 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 7e3 + 69;
vector<pair<int, int>> pos[N];


int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m; cin >> n >> m;
    vector<string> s(n);
    for(int i = 0; i<n; ++i) cin >> s[i];

    for(int i= 0; i<n; ++i) for(int j = 0; j<m; ++j) if (s[i][j] == 'G'){
        int vorp = 0;
        if (i > 0 && i + 1 < n && s[i-1][j] == 'R' && s[i+1][j] == 'W'){
            vorp += 1;
        }
        if (j > 0 && j + 1 < m && s[i][j-1] == 'R' && s[i][j+1] == 'W'){
            vorp += 2;
        }
        if (vorp) pos[i+j].push_back({i, vorp});
    }

    int ans = 0;
    for(int i = 0; i<n+m;++i) if (pos[i].size()){
        int dp[pos[i].size() + 1][3];
        memset(dp, -1, sizeof dp);
        dp[0][2] = 0;
        for(int j = 0; j<pos[i].size(); ++j){
            bool can_skip = (j + 1 == pos[i].size() || pos[i][j+1].first != pos[i][j].first + 1);
            for(int x = 0; x < 3; ++x) if (dp[j][x] != -1){
                maximize(dp[j+1][2], dp[j][x]);
                for(int y = 0; y <= 1; ++y) if (GETBIT(pos[i][j].second, y) && y != (x ^ 1)){
                    int color = y;
                    if (can_skip) color = 2;
                    maximize(dp[j+1][color], dp[j][x] + 1);
                }
            }
        }
        ans += dp[pos[i].size()][2];
    }
    cout << ans << "\n";

    return 0;
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:74:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |         for(int j = 0; j<pos[i].size(); ++j){
      |                        ~^~~~~~~~~~~~~~
dango_maker.cpp:75:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |             bool can_skip = (j + 1 == pos[i].size() || pos[i][j+1].first != pos[i][j].first + 1);
      |                              ~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 632 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 756 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 600 KB Output is correct
49 Correct 1 ms 604 KB Output is correct
50 Correct 1 ms 624 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 1 ms 604 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 632 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 756 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 600 KB Output is correct
49 Correct 1 ms 604 KB Output is correct
50 Correct 1 ms 624 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 1 ms 604 KB Output is correct
54 Correct 1 ms 600 KB Output is correct
55 Correct 1 ms 604 KB Output is correct
56 Correct 1 ms 608 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 14 ms 3572 KB Output is correct
59 Correct 102 ms 26912 KB Output is correct
60 Correct 99 ms 27128 KB Output is correct
61 Correct 100 ms 26828 KB Output is correct
62 Correct 1 ms 600 KB Output is correct
63 Correct 98 ms 26068 KB Output is correct
64 Correct 107 ms 50256 KB Output is correct
65 Correct 107 ms 50224 KB Output is correct
66 Correct 104 ms 49868 KB Output is correct
67 Correct 95 ms 51172 KB Output is correct
68 Correct 94 ms 50980 KB Output is correct
69 Correct 100 ms 49528 KB Output is correct
70 Correct 13 ms 6232 KB Output is correct
71 Correct 12 ms 6232 KB Output is correct
72 Correct 13 ms 6180 KB Output is correct
73 Correct 12 ms 6236 KB Output is correct
74 Correct 12 ms 6232 KB Output is correct
75 Correct 12 ms 6232 KB Output is correct
76 Correct 12 ms 6236 KB Output is correct
77 Correct 12 ms 6236 KB Output is correct
78 Correct 12 ms 6284 KB Output is correct
79 Correct 12 ms 6240 KB Output is correct
80 Correct 12 ms 6236 KB Output is correct
81 Correct 12 ms 6236 KB Output is correct
82 Correct 12 ms 6024 KB Output is correct
83 Correct 13 ms 6236 KB Output is correct
84 Correct 14 ms 6236 KB Output is correct
85 Correct 12 ms 6236 KB Output is correct
86 Correct 13 ms 6232 KB Output is correct
87 Correct 12 ms 6236 KB Output is correct
88 Correct 13 ms 6236 KB Output is correct
89 Correct 12 ms 6028 KB Output is correct
90 Correct 12 ms 6232 KB Output is correct