oj.uz

답안 #199744

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
199744 2020-02-03T06:02:41 Z Mercenary Dango Maker (JOI18_dango_maker) C++14
100 / 100
 274 ms 36856 KB 
#include<bits/stdc++.h>

#define pb push_back
#define mp make_pair
#define taskname "A"

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
const int maxn = 3e3 + 5;
int dp[maxn][3];
int n , m;
string s[maxn];
bool Up(int i ,  int j){
    return i > 0 && i + 1 < m && s[i][j] == 'G' && s[i - 1][j] == 'R' && s[i + 1][j] == 'W';
}
bool Rig(int i , int  j){
    return j > 0 && j + 1 < n && s[i][j] == 'G' && s[i][j - 1] == 'R' && s[i][j + 1] == 'W';
}
bool ok1[maxn][maxn] , ok2[maxn][maxn];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if(fopen(taskname".INP","r")){
		freopen(taskname".INP", "r",stdin);
		freopen(taskname".OUT", "w",stdout);
    }
    cin >> m >> n;
    for(int i = 0 ; i < m ; ++i)cin >> s[i];
    for(int i = 0 ; i < m ; ++i){
        for(int j = 0 ; j < n ; ++j){
            ok1[i][j] = Up(i,j);
            ok2[i][j] = Rig(i,j);
        }
    }
    int res = 0;
    for(int dia = 0 ; dia <= m + n - 2 ; ++dia){
        int tmp = 0;
        int L = max(0,dia-n+1);int R = min(m,dia+1);
        for(int i = L ; i < R ; ++i){
            if(i == L){
                dp[i][0] = dp[i][1] = dp[i][2] = 0;
                if(ok1[i][dia-i])dp[i][1] = 1;
                if(ok2[i][dia-i])dp[i][2] = 1;
                tmp = max(dp[i][1],dp[i][2]);
            }else{
                dp[i][0] = max({dp[i - 1][0] , dp[i - 1][1] , dp[i - 1][2]});
                if(ok1[i][dia-i])dp[i][1] = max(dp[i - 1][0] , dp[i - 1][1]) + 1;
                else dp[i][1] = 0;
                if(ok2[i][dia-i])dp[i][2] = max(dp[i - 1][0] , dp[i - 1][2]) + 1;
                else dp[i][2] = 0;
                tmp = max({tmp , dp[i][0] , dp[i][1] ,  dp[i][2]});
            }
//            cout << dia << " " << dp[i][0] << " " << dp[i][1] << " " << dp[i][2] << endl;
        }
        res += tmp;
    }
    cout << res;
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:29:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".INP", "r",stdin);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:30:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".OUT", "w",stdout);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 508 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 7 ms 508 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 5 ms 504 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 5 ms 504 KB Output is correct
20 Correct 5 ms 504 KB Output is correct
21 Correct 5 ms 504 KB Output is correct
22 Correct 5 ms 504 KB Output is correct
23 Correct 5 ms 504 KB Output is correct
24 Correct 5 ms 504 KB Output is correct
25 Correct 5 ms 504 KB Output is correct
26 Correct 5 ms 504 KB Output is correct
27 Correct 5 ms 504 KB Output is correct
28 Correct 6 ms 504 KB Output is correct
29 Correct 5 ms 504 KB Output is correct
30 Correct 5 ms 504 KB Output is correct
31 Correct 5 ms 504 KB Output is correct
32 Correct 6 ms 508 KB Output is correct
33 Correct 5 ms 504 KB Output is correct
34 Correct 5 ms 504 KB Output is correct
35 Correct 5 ms 504 KB Output is correct
36 Correct 5 ms 504 KB Output is correct
37 Correct 5 ms 504 KB Output is correct
38 Correct 5 ms 504 KB Output is correct
39 Correct 5 ms 504 KB Output is correct
40 Correct 5 ms 504 KB Output is correct
41 Correct 5 ms 504 KB Output is correct
42 Correct 0 ms 376 KB Output is correct
43 Correct 5 ms 504 KB Output is correct
44 Correct 5 ms 504 KB Output is correct
45 Correct 5 ms 504 KB Output is correct
46 Correct 5 ms 504 KB Output is correct
47 Correct 5 ms 504 KB Output is correct
48 Correct 5 ms 504 KB Output is correct
49 Correct 5 ms 504 KB Output is correct
50 Correct 5 ms 504 KB Output is correct
51 Correct 6 ms 504 KB Output is correct
52 Correct 5 ms 504 KB Output is correct
53 Correct 5 ms 504 KB Output is correct
54 Correct 5 ms 376 KB Output is correct
55 Correct 14 ms 18040 KB Output is correct
56 Correct 6 ms 504 KB Output is correct
57 Correct 15 ms 12280 KB Output is correct
58 Correct 33 ms 7392 KB Output is correct
59 Correct 268 ms 27768 KB Output is correct
60 Correct 274 ms 27772 KB Output is correct
61 Correct 273 ms 27768 KB Output is correct
62 Correct 5 ms 504 KB Output is correct
63 Correct 258 ms 27640 KB Output is correct
64 Correct 199 ms 27900 KB Output is correct
65 Correct 202 ms 27772 KB Output is correct
66 Correct 208 ms 29688 KB Output is correct
67 Correct 201 ms 36856 KB Output is correct
68 Correct 206 ms 36600 KB Output is correct
69 Correct 223 ms 36600 KB Output is correct
70 Correct 26 ms 8312 KB Output is correct
71 Correct 25 ms 8312 KB Output is correct
72 Correct 28 ms 8316 KB Output is correct
73 Correct 25 ms 8312 KB Output is correct
74 Correct 26 ms 8312 KB Output is correct
75 Correct 27 ms 8312 KB Output is correct
76 Correct 26 ms 8440 KB Output is correct
77 Correct 28 ms 8444 KB Output is correct
78 Correct 26 ms 8312 KB Output is correct
79 Correct 26 ms 8312 KB Output is correct
80 Correct 26 ms 8312 KB Output is correct
81 Correct 26 ms 8312 KB Output is correct
82 Correct 26 ms 8312 KB Output is correct
83 Correct 26 ms 8312 KB Output is correct
84 Correct 28 ms 8312 KB Output is correct
85 Correct 26 ms 8696 KB Output is correct
86 Correct 26 ms 8312 KB Output is correct
87 Correct 26 ms 8312 KB Output is correct
88 Correct 25 ms 8312 KB Output is correct
89 Correct 26 ms 8312 KB Output is correct
90 Correct 26 ms 8312 KB Output is correct