oj.uz

답안 #467457

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
467457 2021-08-23T04:12:04 Z Killer2501 Dango Maker (JOI18_dango_maker) C++14
100 / 100
 523 ms 216668 KB 
#include <bits/stdc++.h>
#define ll int
#define pb push_back
#define task "tests"
#define pll pair<ll, ll>
#define pi pair<ll, pll>
#define fi first
#define se second

using namespace std;
const ll mod = 1e15;
const ll N = 3e3+5;
const int base = 313;
ll n, m, t, k, T, ans, tong, dp[N*2][3], a[N][N][3];
char c[N][N];
vector<pll> adj[N*2];
vector<ll> kq;
ll pw(ll k, ll n)
{
    ll total = 1;
    for(; n; n >>= 1)
    {
        if(n & 1)total = total * k % mod;
        k = k * k % mod;
    }
    return total;
}
void sol()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i ++)
    {
        for(int j = 1; j <= m; j ++)cin >> c[i][j];
    }
    for(int i = 1; i <= n; i ++)
    {
        for(int j = 1; j <= m; j ++)
        {
            if(i > 1 && i < n)a[i][j][1] = (c[i-1][j] == 'R' && c[i][j] == 'G' && c[i+1][j] == 'W');
            if(j > 1 && j < m)a[i][j][2] = (c[i][j-1] == 'R' && c[i][j] == 'G' && c[i][j+1] == 'W');
            adj[i+j].pb({i, j});
            //if(a[i][j][1])cout << i <<" "<<j<<" "<<1<<'\n';
            //if(a[i][j][2])cout << i <<" "<<j<<" "<<2<<'\n';
        }
    }
    for(int i = 2; i <= m+n; i ++)
    {
        k = adj[i].size();
        for(int j = 1; j <= k; j ++)
        {
            ll x = adj[i][j-1].fi, y = adj[i][j-1].se;
            dp[j][0] = max(dp[j-1][0], max(dp[j-1][1], dp[j-1][2]));
            for(int p = 1; p <= 2; p ++)
            {
                if(a[x][y][p])dp[j][p] = max(dp[j-1][p], dp[j-1][0]) + 1;
                else dp[j][p] = 0;
            }
        }
        ans += max(dp[k][0], max(dp[k][1], dp[k][2]));
        //cout << max(dp[k][0], max(dp[k][1], dp[k][2])) <<" ";
    }
    cout << ans;
}
int main()
{
    if(fopen(task".in", "r"))
    {
       freopen(task".in", "r", stdin);
       freopen(task".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int ntest = 1;
    //cin >> ntest;
    while(ntest -- > 0)
    sol();
}
/*
4 5 2
10 9 5 2
6 4 20 15
9 7 10 9
-1 -1 16 11
1 2 3
2 3 3
1 4 1
4 3 1
3 1 1

*/

Compilation message

dango_maker.cpp:11:16: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+15' to '2147483647' [-Woverflow]
   11 | const ll mod = 1e15;
      |                ^~~~
dango_maker.cpp: In function 'int main()':
dango_maker.cpp:68:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |        freopen(task".in", "r", stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:69:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |        freopen(task".out", "w", stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 1 ms 460 KB Output is correct
34 Correct 1 ms 460 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 1 ms 460 KB Output is correct
37 Correct 1 ms 460 KB Output is correct
38 Correct 1 ms 460 KB Output is correct
39 Correct 1 ms 460 KB Output is correct
40 Correct 1 ms 460 KB Output is correct
41 Correct 1 ms 528 KB Output is correct
42 Correct 1 ms 460 KB Output is correct
43 Correct 1 ms 460 KB Output is correct
44 Correct 1 ms 460 KB Output is correct
45 Correct 1 ms 460 KB Output is correct
46 Correct 1 ms 460 KB Output is correct
47 Correct 1 ms 460 KB Output is correct
48 Correct 1 ms 460 KB Output is correct
49 Correct 1 ms 460 KB Output is correct
50 Correct 1 ms 460 KB Output is correct
51 Correct 1 ms 460 KB Output is correct
52 Correct 1 ms 460 KB Output is correct
53 Correct 1 ms 460 KB Output is correct
54 Correct 1 ms 588 KB Output is correct
55 Correct 11 ms 21528 KB Output is correct
56 Correct 2 ms 844 KB Output is correct
57 Correct 8 ms 14796 KB Output is correct
58 Correct 55 ms 30276 KB Output is correct
59 Correct 511 ms 216476 KB Output is correct
60 Correct 519 ms 216532 KB Output is correct
61 Correct 509 ms 216516 KB Output is correct
62 Correct 1 ms 588 KB Output is correct
63 Correct 488 ms 213188 KB Output is correct
64 Correct 489 ms 216444 KB Output is correct
65 Correct 523 ms 216484 KB Output is correct
66 Correct 478 ms 216536 KB Output is correct
67 Correct 473 ms 216516 KB Output is correct
68 Correct 474 ms 216452 KB Output is correct
69 Correct 476 ms 216668 KB Output is correct
70 Correct 53 ms 30724 KB Output is correct
71 Correct 51 ms 30704 KB Output is correct
72 Correct 53 ms 30752 KB Output is correct
73 Correct 61 ms 30712 KB Output is correct
74 Correct 50 ms 30788 KB Output is correct
75 Correct 51 ms 30728 KB Output is correct
76 Correct 51 ms 30724 KB Output is correct
77 Correct 50 ms 30668 KB Output is correct
78 Correct 52 ms 30660 KB Output is correct
79 Correct 51 ms 30760 KB Output is correct
80 Correct 50 ms 30756 KB Output is correct
81 Correct 51 ms 30728 KB Output is correct
82 Correct 50 ms 30704 KB Output is correct
83 Correct 50 ms 30784 KB Output is correct
84 Correct 60 ms 30728 KB Output is correct
85 Correct 51 ms 30676 KB Output is correct
86 Correct 50 ms 30712 KB Output is correct
87 Correct 50 ms 30744 KB Output is correct
88 Correct 53 ms 30660 KB Output is correct
89 Correct 51 ms 30660 KB Output is correct
90 Correct 60 ms 30656 KB Output is correct