oj.uz

답안 #61435

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61435 2018-07-26T01:23:17 Z Benq Dango Maker (JOI18_dango_maker) C++11
0 / 100
 3 ms 732 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 3000;

int N,M,ok[MX][MX][2];
string s[MX];


int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> M;
    F0R(i,N) cin >> s[i];
    F0R(i,N) F0R(j,M) if (s[i][j] == 'G') {
        if (i-1 >= 0 && i+1 < N && s[i-1][j] == 'R' && s[i+1][j] == 'W') ok[i][j][0] = 1;
        if (j-1 >= 0 && j+1 < M && s[i][j-1] == 'R' && s[i][j+1] == 'W') ok[i][j][1] = 1;
    }
    
    int ans = 0;
    
    F0R(sum,N+M-1) {
        vpi q;
        array<int,3> cur = {0,0,0};
        F0R(i,N) if (0 <= sum-i && sum-i < M) {
            int j = sum-i;
            array<int,3> ret = {max(cur[0],max(cur[1],cur[2])),0,0};
            if (ok[i][j][0]) ret[1] = max(cur[0],cur[2])+1;
            if (ok[i][j][1]) ret[2] = max(cur[0],cur[1])+1;
            cur = ret;
        }
        
        ans += max(max(cur[0],cur[1]),cur[2]);
    }
    
    cout << ans;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 3 ms 560 KB Output is correct
5 Correct 3 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 3 ms 732 KB Output is correct
8 Incorrect 1 ms 732 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 3 ms 560 KB Output is correct
5 Correct 3 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 3 ms 732 KB Output is correct
8 Incorrect 1 ms 732 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 3 ms 560 KB Output is correct
5 Correct 3 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 3 ms 732 KB Output is correct
8 Incorrect 1 ms 732 KB Output isn't correct
9 Halted 0 ms 0 KB -