oj.uz

답안 #645816

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
645816 2022-09-28T04:56:03 Z ToroTN Dango Maker (JOI18_dango_maker) C++14
100 / 100
 127 ms 18096 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define X first
#define Y second
int n,m,dp[3005][3],cnt=0,val;
char s[3005][3005];
vector<pair<int,int> > v;
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        scanf("%s",s[i]+1);
    }
    for(int i=n;i>=1;i--)
    {
        v.pb({i,1});
    }
    for(int j=2;j<=m;j++)
    {
        v.pb({n,j});
    }
    for(int i=0;i<v.size();i++)
    {
        memset(dp,0,sizeof dp);
        //printf("section %d:%d %d\n",i,v[i].X,v[i].Y);
        for(int x=v[i].X,y=v[i].Y;x>=1&&y<=m;x--,y++)
        {
            //printf("%d %d\n",x,y);
            dp[y][0]=max(dp[y][0],dp[y-1][0]);
            if(y>=3)
            {
                if(s[x][y]=='W'&&s[x][y-1]=='G'&&s[x][y-2]=='R')
                {
                    dp[y][1]=max(dp[y-1][1],dp[y-3][2])+1;
                    dp[y][1]=max(dp[y][1],dp[y-2][1]+1);
                    dp[y][1]=max(dp[y][1],dp[y-3][0]+1);
                }
            }
            if(x>=3)
            {
                if(s[x][y]=='W'&&s[x-1][y]=='G'&&s[x-2][y]=='R')
                {
                    dp[y][2]=max(dp[y-1][2],dp[y-1][1])+1;
                    dp[y][2]=max(dp[y][2],dp[y-1][0]+1);
                }
            }
            dp[y][0]=max(dp[y][0],dp[y][1]);
            dp[y][0]=max(dp[y][0],dp[y][2]);
            val=dp[y][0];
            //printf("%d %d\n",y,dp[y][0]);
        }
        cnt+=val;
    }
    printf("%d\n",cnt);
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:24:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~
dango_maker.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
dango_maker.cpp:14:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |         scanf("%s",s[i]+1);
      |         ~~~~~^~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 312 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 308 KB Output is correct
27 Correct 0 ms 312 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 316 KB Output is correct
34 Correct 1 ms 304 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 308 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 308 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 0 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 3 ms 340 KB Output is correct
55 Correct 6 ms 9172 KB Output is correct
56 Correct 3 ms 340 KB Output is correct
57 Correct 5 ms 6276 KB Output is correct
58 Correct 17 ms 4288 KB Output is correct
59 Correct 127 ms 18068 KB Output is correct
60 Correct 126 ms 18096 KB Output is correct
61 Correct 125 ms 17948 KB Output is correct
62 Correct 3 ms 340 KB Output is correct
63 Correct 117 ms 17760 KB Output is correct
64 Correct 107 ms 18064 KB Output is correct
65 Correct 105 ms 18060 KB Output is correct
66 Correct 103 ms 18060 KB Output is correct
67 Correct 91 ms 18060 KB Output is correct
68 Correct 123 ms 18056 KB Output is correct
69 Correct 101 ms 18052 KB Output is correct
70 Correct 14 ms 4184 KB Output is correct
71 Correct 14 ms 4180 KB Output is correct
72 Correct 13 ms 4172 KB Output is correct
73 Correct 14 ms 4300 KB Output is correct
74 Correct 13 ms 4172 KB Output is correct
75 Correct 14 ms 4180 KB Output is correct
76 Correct 13 ms 4180 KB Output is correct
77 Correct 14 ms 4180 KB Output is correct
78 Correct 15 ms 4180 KB Output is correct
79 Correct 14 ms 4180 KB Output is correct
80 Correct 15 ms 4208 KB Output is correct
81 Correct 13 ms 4208 KB Output is correct
82 Correct 14 ms 4188 KB Output is correct
83 Correct 14 ms 4204 KB Output is correct
84 Correct 14 ms 4208 KB Output is correct
85 Correct 14 ms 4308 KB Output is correct
86 Correct 14 ms 4180 KB Output is correct
87 Correct 14 ms 4188 KB Output is correct
88 Correct 13 ms 4208 KB Output is correct
89 Correct 14 ms 4204 KB Output is correct
90 Correct 13 ms 4180 KB Output is correct