oj.uz

Submission #57987

# Submission time Handle Problem Language Result Execution time Memory
57987 2018-07-16T15:15:34 Z Benq Bob (COCI14_bob) C++14
120 / 120
 205 ms 64432 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 = 100001;

ll ans = 0;

template<int SZ> struct DSU {
    int par[SZ], sz[SZ];
    DSU() {
        F0R(i,SZ) par[i] = -1, sz[i] = 1;
    }
    
    int get(int x) { // path compression
        if (par[x] != x) par[x] = get(par[x]);
        return par[x];
    }
    
    bool unite(int x, int y, int z) { // union-by-rank
        x = get(x), y = get(y);
        if (sz[x] < sz[y]) swap(x,y);
        ans += z*sz[x]*sz[y];
        sz[x] += sz[y], par[y] = x;
        return 1;
    }
};
 
int n,m,cur[1000];
int g[1000][1000];
vi nex[1001];
 
void solve(int x) {
    F0R(i,m+1) nex[i].clear();
    F0R(i,n) nex[cur[i]-x].pb(i);
    
    DSU<1000> D = DSU<1000>();
    F0Rd(i,m+1) for (int a: nex[i]) {
        // cout << a << "\n";
        D.par[a] = a; ans += i;
        if (a > 0 && D.par[a-1] != -1 && g[a][x] == g[a-1][x]) D.unite(a,a-1,i);
        if (a < n-1 && D.par[a+1] != -1 && g[a][x] == g[a+1][x]) D.unite(a,a+1,i);
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    F0R(i,n) F0R(j,m) cin >> g[i][j];
    
    F0R(i,n) cur[i] = m;
    F0Rd(j,m) {
        if (j != m-1) F0R(i,n) if (g[i][j] != g[i][j+1]) cur[i] = j+1;
        solve(j);
    }
    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
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
12.0 / 12.0

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

Subtask #5
12.0 / 12.0

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

Subtask #6
12.0 / 12.0

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

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 15796 KB Output is correct
2 Correct 95 ms 21608 KB Output is correct
3 Correct 183 ms 23636 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 29324 KB Output is correct
2 Correct 120 ms 32960 KB Output is correct
3 Correct 103 ms 37136 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 44248 KB Output is correct
2 Correct 96 ms 48760 KB Output is correct
3 Correct 104 ms 50804 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 57112 KB Output is correct
2 Correct 124 ms 62464 KB Output is correct
3 Correct 136 ms 64432 KB Output is correct