oj.uz

Submission #252524

# Submission time Handle Problem Language Result Execution time Memory
252524 2020-07-25T17:57:14 Z caoash Dango Maker (JOI18_dango_maker) C++14
100 / 100
 247 ms 18168 KB 
/*
Draw some cases and realize that the only moves affected by the current move (vertical or horizontal) are the moves in the same diagonal.

This allows you to solve separately for each diagonal, and do a dp[row][move in previous row] and sum up the answer for all diagonals.
*/

#pragma GCC target ("sse4")

#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 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 pair<int, pi> pii;

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

#define fax(i, a) for (int i = 0; i < (a); i++)
#define f0x(i, a, b) for (int i = (a); i < (b); i++)
#define f0xd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define faxd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define memeset memset

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

template <class T, int ...Ns> struct BIT {
    T val = 0;
    void upd(T v) { val += v; }
    T query() { return val; }
};
 
template <class T, int N, int... Ns> struct BIT<T, N, Ns...> {
    BIT<T,Ns...> bit[N + 1];
    template<typename... Args> void upd(int pos, Args... args) {
        for (; pos <= N; pos += (pos&-pos)) bit[pos].upd(args...);
    }
    template<typename... Args> T sum(int r, Args... args) {
        T res = 0; for (; r; r -= (r&-r)) res += bit[r].query(args...); 
        return res;
    }
    template<typename... Args> T query(int l, int r, Args... args) {
        return sum(r,args...)-sum(l-1,args...);
    }
};

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class T, class... Ts> void re(T& t, Ts&... ts) { 
        re(t); re(ts...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { fax(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { fax(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T> void pr(const T& x);
    
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
        pr(t); pr(ts...); 
    }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void pr(const T& x) { 
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
    }
    
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
    }
    #define dbg(x...) pr("[",#x,"] = ["), pc(x);
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 3005;
const ld PI = 4*atan((ld)1);

char grid[MX][MX]; ll dp[MX][3];

int main() {
    setIO(); 
    int n, m; re(n, m);
    fax(i, n){
    	fax(j, m){
    		re(grid[i][j]);
    	}
    }
    ll ans = 0;
    fax(c, 2 * MX){
    	memeset(dp, 0, sizeof(dp));
    	int lr = 0;
    	fax(r, n){
    		int nc = c - r;
    		if(nc < 0 || r > n - 1 || nc > m - 1) {
    			continue;
    		}
    		ckmax(lr, r);
    		if(r == 0){
    			dp[r][0] = 0;
    			if(nc > 0 && nc != m - 1){
	    			if(grid[r][nc] == 'G' && grid[r][nc - 1] == 'R' && grid[r][nc + 1] == 'W'){
	    				dp[r][2] = 1;
	    			}
	    		}
	    		// dbg(r, nc, dp[r][0], dp[r][1], dp[r][2]);
	    		continue;
    		}
    		ckmax(dp[r][0], max({dp[r - 1][0], dp[r - 1][1], dp[r - 1][2]}));
    		if(r > 0 && r != n - 1){
    			if(grid[r][nc] == 'G' && grid[r - 1][nc] == 'R' && grid[r + 1][nc] == 'W'){
    				ckmax(dp[r][1], max({dp[r - 1][0], dp[r - 1][1]}) + 1);
    			}
    		}
    		if(nc > 0 && nc != m - 1)	{
    			if(grid[r][nc] == 'G' && grid[r][nc - 1] == 'R' && grid[r][nc + 1] == 'W'){
    				ckmax(dp[r][2], max({dp[r - 1][0], dp[r - 1][2]}) + 1);
    			}
    		}
    	}
    	ans += max({dp[lr][0], dp[lr][1], dp[lr][2]});
    }
    ps(ans);
}

Compilation message

dango_maker.cpp: In function 'void io::setIn(std::__cxx11::string)':
dango_maker.cpp:139:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp: In function 'void io::setOut(std::__cxx11::string)':
dango_maker.cpp:140:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 384 KB Output is correct
2 Correct 13 ms 384 KB Output is correct
3 Correct 13 ms 384 KB Output is correct
4 Correct 13 ms 384 KB Output is correct
5 Correct 13 ms 384 KB Output is correct
6 Correct 13 ms 384 KB Output is correct
7 Correct 13 ms 384 KB Output is correct
8 Correct 13 ms 384 KB Output is correct
9 Correct 13 ms 384 KB Output is correct
10 Correct 13 ms 476 KB Output is correct
11 Correct 13 ms 384 KB Output is correct
12 Correct 12 ms 384 KB Output is correct
13 Correct 14 ms 384 KB Output is correct
14 Correct 12 ms 384 KB Output is correct
15 Correct 13 ms 384 KB Output is correct
16 Correct 13 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 384 KB Output is correct
2 Correct 13 ms 384 KB Output is correct
3 Correct 13 ms 384 KB Output is correct
4 Correct 13 ms 384 KB Output is correct
5 Correct 13 ms 384 KB Output is correct
6 Correct 13 ms 384 KB Output is correct
7 Correct 13 ms 384 KB Output is correct
8 Correct 13 ms 384 KB Output is correct
9 Correct 13 ms 384 KB Output is correct
10 Correct 13 ms 476 KB Output is correct
11 Correct 13 ms 384 KB Output is correct
12 Correct 12 ms 384 KB Output is correct
13 Correct 14 ms 384 KB Output is correct
14 Correct 12 ms 384 KB Output is correct
15 Correct 13 ms 384 KB Output is correct
16 Correct 13 ms 384 KB Output is correct
17 Correct 13 ms 384 KB Output is correct
18 Correct 12 ms 384 KB Output is correct
19 Correct 14 ms 384 KB Output is correct
20 Correct 21 ms 384 KB Output is correct
21 Correct 12 ms 384 KB Output is correct
22 Correct 14 ms 384 KB Output is correct
23 Correct 12 ms 384 KB Output is correct
24 Correct 13 ms 384 KB Output is correct
25 Correct 12 ms 384 KB Output is correct
26 Correct 12 ms 384 KB Output is correct
27 Correct 12 ms 512 KB Output is correct
28 Correct 13 ms 384 KB Output is correct
29 Correct 12 ms 384 KB Output is correct
30 Correct 15 ms 384 KB Output is correct
31 Correct 13 ms 384 KB Output is correct
32 Correct 13 ms 384 KB Output is correct
33 Correct 12 ms 384 KB Output is correct
34 Correct 13 ms 512 KB Output is correct
35 Correct 12 ms 384 KB Output is correct
36 Correct 13 ms 384 KB Output is correct
37 Correct 12 ms 496 KB Output is correct
38 Correct 13 ms 384 KB Output is correct
39 Correct 13 ms 384 KB Output is correct
40 Correct 14 ms 384 KB Output is correct
41 Correct 12 ms 384 KB Output is correct
42 Correct 13 ms 384 KB Output is correct
43 Correct 13 ms 384 KB Output is correct
44 Correct 13 ms 384 KB Output is correct
45 Correct 12 ms 384 KB Output is correct
46 Correct 12 ms 496 KB Output is correct
47 Correct 13 ms 384 KB Output is correct
48 Correct 12 ms 496 KB Output is correct
49 Correct 12 ms 384 KB Output is correct
50 Correct 13 ms 384 KB Output is correct
51 Correct 13 ms 384 KB Output is correct
52 Correct 13 ms 384 KB Output is correct
53 Correct 12 ms 384 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 384 KB Output is correct
2 Correct 13 ms 384 KB Output is correct
3 Correct 13 ms 384 KB Output is correct
4 Correct 13 ms 384 KB Output is correct
5 Correct 13 ms 384 KB Output is correct
6 Correct 13 ms 384 KB Output is correct
7 Correct 13 ms 384 KB Output is correct
8 Correct 13 ms 384 KB Output is correct
9 Correct 13 ms 384 KB Output is correct
10 Correct 13 ms 476 KB Output is correct
11 Correct 13 ms 384 KB Output is correct
12 Correct 12 ms 384 KB Output is correct
13 Correct 14 ms 384 KB Output is correct
14 Correct 12 ms 384 KB Output is correct
15 Correct 13 ms 384 KB Output is correct
16 Correct 13 ms 384 KB Output is correct
17 Correct 13 ms 384 KB Output is correct
18 Correct 12 ms 384 KB Output is correct
19 Correct 14 ms 384 KB Output is correct
20 Correct 21 ms 384 KB Output is correct
21 Correct 12 ms 384 KB Output is correct
22 Correct 14 ms 384 KB Output is correct
23 Correct 12 ms 384 KB Output is correct
24 Correct 13 ms 384 KB Output is correct
25 Correct 12 ms 384 KB Output is correct
26 Correct 12 ms 384 KB Output is correct
27 Correct 12 ms 512 KB Output is correct
28 Correct 13 ms 384 KB Output is correct
29 Correct 12 ms 384 KB Output is correct
30 Correct 15 ms 384 KB Output is correct
31 Correct 13 ms 384 KB Output is correct
32 Correct 13 ms 384 KB Output is correct
33 Correct 12 ms 384 KB Output is correct
34 Correct 13 ms 512 KB Output is correct
35 Correct 12 ms 384 KB Output is correct
36 Correct 13 ms 384 KB Output is correct
37 Correct 12 ms 496 KB Output is correct
38 Correct 13 ms 384 KB Output is correct
39 Correct 13 ms 384 KB Output is correct
40 Correct 14 ms 384 KB Output is correct
41 Correct 12 ms 384 KB Output is correct
42 Correct 13 ms 384 KB Output is correct
43 Correct 13 ms 384 KB Output is correct
44 Correct 13 ms 384 KB Output is correct
45 Correct 12 ms 384 KB Output is correct
46 Correct 12 ms 496 KB Output is correct
47 Correct 13 ms 384 KB Output is correct
48 Correct 12 ms 496 KB Output is correct
49 Correct 12 ms 384 KB Output is correct
50 Correct 13 ms 384 KB Output is correct
51 Correct 13 ms 384 KB Output is correct
52 Correct 13 ms 384 KB Output is correct
53 Correct 12 ms 384 KB Output is correct
54 Correct 12 ms 384 KB Output is correct
55 Correct 35 ms 9248 KB Output is correct
56 Correct 13 ms 512 KB Output is correct
57 Correct 45 ms 6272 KB Output is correct
58 Correct 42 ms 4352 KB Output is correct
59 Correct 236 ms 18168 KB Output is correct
60 Correct 247 ms 18040 KB Output is correct
61 Correct 240 ms 18168 KB Output is correct
62 Correct 14 ms 384 KB Output is correct
63 Correct 230 ms 17784 KB Output is correct
64 Correct 207 ms 18040 KB Output is correct
65 Correct 203 ms 18040 KB Output is correct
66 Correct 208 ms 18168 KB Output is correct
67 Correct 212 ms 18040 KB Output is correct
68 Correct 211 ms 18040 KB Output is correct
69 Correct 212 ms 18040 KB Output is correct
70 Correct 38 ms 4352 KB Output is correct
71 Correct 39 ms 4352 KB Output is correct
72 Correct 41 ms 4352 KB Output is correct
73 Correct 38 ms 4352 KB Output is correct
74 Correct 38 ms 4352 KB Output is correct
75 Correct 38 ms 4352 KB Output is correct
76 Correct 50 ms 4352 KB Output is correct
77 Correct 39 ms 4352 KB Output is correct
78 Correct 39 ms 4352 KB Output is correct
79 Correct 40 ms 4352 KB Output is correct
80 Correct 44 ms 4344 KB Output is correct
81 Correct 39 ms 4352 KB Output is correct
82 Correct 39 ms 4352 KB Output is correct
83 Correct 39 ms 4352 KB Output is correct
84 Correct 39 ms 4352 KB Output is correct
85 Correct 39 ms 4352 KB Output is correct
86 Correct 37 ms 4352 KB Output is correct
87 Correct 38 ms 4404 KB Output is correct
88 Correct 38 ms 4352 KB Output is correct
89 Correct 41 ms 4352 KB Output is correct
90 Correct 38 ms 4352 KB Output is correct