oj.uz

Submission #632118

# Submission time Handle Problem Language Result Execution time Memory
632118 2022-08-19T12:52:04 Z Soul234 Bob (COCI14_bob) C++14
120 / 120
 161 ms 25780 KB 
#include<bits/stdc++.h>
using namespace std;

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"
#define fi first
#define se second

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

tcT> bool ckmin(T&a, const T&b) {
    return b < a ? a=b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) {
    return b > a ? a=b,1 : 0; }

const int MOD = 1e9 + 7;

const int MX = 1e3+5;
int N, M, A[MX][MX], h[MX][MX];
ll dp[MX][MX], ans;

void solve() {
    cin >> N >> M;
    FOR(i,1,N+1) {
        FOR(j,1,M+1) cin >> A[i][j];
    }
    FOR(i,1,N+1) {
        stack<pi> st;
        st.push({0, 0});
        FOR(j,1,M+1) {
            h[i][j] = 1;
            if(A[i][j] == A[i-1][j]) h[i][j] += h[i-1][j];
            int w = 1;
            while(A[i][st.top().fi] == A[i][j] && h[i][st.top().fi] >= h[i][j]) {
                w += st.top().se;
                st.pop();
            }
            dp[i][j] = A[i][st.top().fi] == A[i][j] ? dp[i][st.top().fi] : 0;
            dp[i][j] += 1LL * w * h[i][j];
            ans += dp[i][j];
            st.push({j, w});
        }
    }
    cout << ans << nl;
}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message

bob.cpp: In function 'void setIO(std::string)':
bob.cpp:39:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bob.cpp:40:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 8668 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 9120 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 9252 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 9276 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 22648 KB Output is correct
2 Correct 66 ms 17932 KB Output is correct
3 Correct 63 ms 17948 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 25780 KB Output is correct
2 Correct 78 ms 17996 KB Output is correct
3 Correct 70 ms 17964 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 25568 KB Output is correct
2 Correct 63 ms 17980 KB Output is correct
3 Correct 71 ms 17868 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 25684 KB Output is correct
2 Correct 70 ms 17896 KB Output is correct
3 Correct 61 ms 17860 KB Output is correct