oj.uz

답안 #445118

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
445118 2021-07-16T13:15:16 Z zaneyu Dango Maker (JOI18_dango_maker) C++14
100 / 100
 992 ms 100676 KB 
/*input
3 4
RGWR
GRGG
RGWW

*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=1e18+1;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
inline ll mult(ll a,ll b){
    if(a>=MOD) a%=MOD;
    if(b>=MOD) b%=MOD;
    return (a*b)%MOD;
}
inline ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
const int maxn=4e3+7;
const int maxlg=__lg(maxn)+2;
string arr[maxn];
string ans="RGW";
int dp[maxn][maxn][2];
bool ok(int o,int i,int j){
    string a="";
    if(o) REP(k,3) a.pb(arr[i][j+k-1]);
    else REP(k,3) a.pb(arr[i+k-1][j]);
    return (a==ans);
}
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,m;
    cin>>n>>m;
    REP1(i,n){
        cin>>arr[i];
        arr[i]='0'+arr[i];
        arr[i].pb('0');
    }
    REP(i,n+1) REP(j,m+1) REP(a,2) dp[i][j][a]=-INF;
    int ans=0;
    for(int i=2;i<=n+m;i++){
        int mx=0;
        int X=-1,Y=-1;
        for(int x=max(1,i-m);x<=min(n,i-1);x++){
            int y=i-x;
            REP(a,2){
                if(ok(a,x,y)){
                    dp[x][y][a]=max(mx,dp[x-1][y+1][a])+1;
                }
            }
            REP(a,2) MXTO(mx,dp[x-1][y+1][a]);
            X=x,Y=y;
        }
        REP(a,2) MXTO(mx,dp[X][Y][a]);
        ans+=mx;
    }
    cout<<ans<<'\n';
}

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 0 ms 460 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 0 ms 460 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 0 ms 460 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 0 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 0 ms 460 KB Output is correct
32 Correct 0 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 0 ms 460 KB Output is correct
37 Correct 0 ms 460 KB Output is correct
38 Correct 0 ms 460 KB Output is correct
39 Correct 0 ms 460 KB Output is correct
40 Correct 1 ms 460 KB Output is correct
41 Correct 0 ms 460 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 0 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 0 ms 460 KB Output is correct
52 Correct 1 ms 460 KB Output is correct
53 Correct 0 ms 460 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 0 ms 460 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 0 ms 460 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 0 ms 460 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 0 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 0 ms 460 KB Output is correct
32 Correct 0 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 0 ms 460 KB Output is correct
37 Correct 0 ms 460 KB Output is correct
38 Correct 0 ms 460 KB Output is correct
39 Correct 0 ms 460 KB Output is correct
40 Correct 1 ms 460 KB Output is correct
41 Correct 0 ms 460 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 0 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 0 ms 460 KB Output is correct
52 Correct 1 ms 460 KB Output is correct
53 Correct 0 ms 460 KB Output is correct
54 Correct 1 ms 460 KB Output is correct
55 Correct 6 ms 12552 KB Output is correct
56 Correct 2 ms 588 KB Output is correct
57 Correct 5 ms 8612 KB Output is correct
58 Correct 94 ms 14284 KB Output is correct
59 Correct 966 ms 100676 KB Output is correct
60 Correct 964 ms 100644 KB Output is correct
61 Correct 980 ms 100676 KB Output is correct
62 Correct 1 ms 460 KB Output is correct
63 Correct 958 ms 97804 KB Output is correct
64 Correct 979 ms 100676 KB Output is correct
65 Correct 977 ms 100676 KB Output is correct
66 Correct 980 ms 100676 KB Output is correct
67 Correct 992 ms 100676 KB Output is correct
68 Correct 984 ms 100676 KB Output is correct
69 Correct 961 ms 100676 KB Output is correct
70 Correct 92 ms 14364 KB Output is correct
71 Correct 93 ms 14284 KB Output is correct
72 Correct 92 ms 14320 KB Output is correct
73 Correct 91 ms 14284 KB Output is correct
74 Correct 93 ms 14284 KB Output is correct
75 Correct 93 ms 14240 KB Output is correct
76 Correct 93 ms 14320 KB Output is correct
77 Correct 92 ms 14404 KB Output is correct
78 Correct 91 ms 14284 KB Output is correct
79 Correct 90 ms 14284 KB Output is correct
80 Correct 92 ms 14284 KB Output is correct
81 Correct 90 ms 14320 KB Output is correct
82 Correct 92 ms 14316 KB Output is correct
83 Correct 91 ms 15308 KB Output is correct
84 Correct 91 ms 15304 KB Output is correct
85 Correct 92 ms 15308 KB Output is correct
86 Correct 94 ms 15308 KB Output is correct
87 Correct 93 ms 15308 KB Output is correct
88 Correct 93 ms 15308 KB Output is correct
89 Correct 92 ms 15308 KB Output is correct
90 Correct 93 ms 15308 KB Output is correct