oj.uz

답안 #893769

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
893769 2023-12-27T11:23:28 Z Aiperiii Dango Maker (JOI18_dango_maker) C++14
100 / 100
 495 ms 102164 KB 
#include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
using namespace std;
char a[3005][3005];
vector <int> ind[6005];
signed main(){
    int n,m;
    cin>>n>>m;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cin>>a[i][j];
            ind[i+j].pb(i);
        }
    }
    
    int ans=0;
    for(int i=0;i<n+m-1;i++){
        
        int dp[ind[i].size()][3];
        
        for(int j=ind[i].size()-1;j>=0;j--){
            int x=ind[i][j],y=i-ind[i][j];
            dp[j][0]=0;dp[j][1]=0;dp[j][2]=0;
            
            if(j+1<ind[i].size())dp[j][0]=max({dp[j+1][0],dp[j+1][1],dp[j+1][2]});
               
            if(y+1<m && y-1>=0 && a[x][y]=='G' && a[x][y+1]=='W' && a[x][y-1]=='R'){
                if(j+1<ind[i].size())dp[j][1]=max(dp[j+1][0],dp[j+1][1]);
                dp[j][1]++;
            }
            if(x+1<n && x-1>=0 && a[x][y]=='G' && a[x+1][y]=='W' && a[x-1][y]=='R'){
                if(j+1<ind[i].size())dp[j][2]=max(dp[j+1][0],dp[j+1][2]);
                dp[j][2]++;
            }
        }
        ans+=max({dp[0][0],dp[0][1],dp[0][2]});
    }
    cout<<ans<<"\n";
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:29:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |             if(j+1<ind[i].size())dp[j][0]=max({dp[j+1][0],dp[j+1][1],dp[j+1][2]});
      |                ~~~^~~~~~~~~~~~~~
dango_maker.cpp:32:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |                 if(j+1<ind[i].size())dp[j][1]=max(dp[j+1][0],dp[j+1][1]);
      |                    ~~~^~~~~~~~~~~~~~
dango_maker.cpp:36:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |                 if(j+1<ind[i].size())dp[j][2]=max(dp[j+1][0],dp[j+1][2]);
      |                    ~~~^~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 596 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 0 ms 600 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 0 ms 604 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 0 ms 604 KB Output is correct
30 Correct 0 ms 604 KB Output is correct
31 Correct 0 ms 604 KB Output is correct
32 Correct 0 ms 604 KB Output is correct
33 Correct 0 ms 604 KB Output is correct
34 Correct 0 ms 604 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 0 ms 604 KB Output is correct
37 Correct 1 ms 600 KB Output is correct
38 Correct 0 ms 604 KB Output is correct
39 Correct 0 ms 604 KB Output is correct
40 Correct 0 ms 604 KB Output is correct
41 Correct 0 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 0 ms 604 KB Output is correct
45 Correct 0 ms 604 KB Output is correct
46 Correct 0 ms 604 KB Output is correct
47 Correct 0 ms 604 KB Output is correct
48 Correct 0 ms 600 KB Output is correct
49 Correct 0 ms 604 KB Output is correct
50 Correct 0 ms 604 KB Output is correct
51 Correct 1 ms 600 KB Output is correct
52 Correct 0 ms 604 KB Output is correct
53 Correct 0 ms 604 KB Output is correct
54 Correct 1 ms 604 KB Output is correct
55 Correct 2 ms 9308 KB Output is correct
56 Correct 2 ms 860 KB Output is correct
57 Correct 2 ms 6748 KB Output is correct
58 Correct 51 ms 15224 KB Output is correct
59 Correct 495 ms 101892 KB Output is correct
60 Correct 495 ms 101960 KB Output is correct
61 Correct 484 ms 101968 KB Output is correct
62 Correct 1 ms 604 KB Output is correct
63 Correct 459 ms 99156 KB Output is correct
64 Correct 444 ms 101972 KB Output is correct
65 Correct 436 ms 102164 KB Output is correct
66 Correct 428 ms 102076 KB Output is correct
67 Correct 424 ms 101876 KB Output is correct
68 Correct 441 ms 102072 KB Output is correct
69 Correct 459 ms 101968 KB Output is correct
70 Correct 46 ms 15284 KB Output is correct
71 Correct 58 ms 15260 KB Output is correct
72 Correct 46 ms 15192 KB Output is correct
73 Correct 45 ms 15188 KB Output is correct
74 Correct 46 ms 15184 KB Output is correct
75 Correct 46 ms 15292 KB Output is correct
76 Correct 50 ms 15184 KB Output is correct
77 Correct 47 ms 15272 KB Output is correct
78 Correct 45 ms 15184 KB Output is correct
79 Correct 46 ms 15188 KB Output is correct
80 Correct 46 ms 15188 KB Output is correct
81 Correct 56 ms 15200 KB Output is correct
82 Correct 47 ms 15196 KB Output is correct
83 Correct 47 ms 15344 KB Output is correct
84 Correct 46 ms 15188 KB Output is correct
85 Correct 46 ms 15176 KB Output is correct
86 Correct 45 ms 15188 KB Output is correct
87 Correct 46 ms 15200 KB Output is correct
88 Correct 46 ms 15188 KB Output is correct
89 Correct 49 ms 15184 KB Output is correct
90 Correct 45 ms 15188 KB Output is correct