oj.uz

답안 #395660

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
395660 2021-04-28T17:50:58 Z MarcoMeijer Islands (IOI08_islands) C++14
90 / 100
 1083 ms 131076 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 1e6+8;
const int N = (1<<20);

int n, edges;
int l[MX*2];
vii adj[MX];

// finding cycles
bitset<MX> visited;
int cycleStart;
int skippedEdge = -1;
vii cycle;
bool dfsVisit(int u, int pe) {
    if(visited[u]) {
        cycleStart = u;
        skippedEdge = pe;
        return true;
    }
    bool res = false;
    visited[u] = 1;
    FOR(e,adj[u]) {
        if(e.se == pe || e.se == skippedEdge) continue;
        if(!dfsVisit(e.fi, e.se^1)) continue;
        
        cycle.pb({e.fi, l[e.se]});
        res = u != cycleStart;
    }
    return res;
}

// finding depth
ll curBest = 0;
lll combine(lll x, ll y) {return {max(x.fi,y), max(min(x.fi,y),x.se)};}
int i1, i2;
ll dfsDepth(int u, int pe) {
    ll res = 0;
    lll p = {0,0};
    FOR(e,adj[u]) {
        if(e.se == pe) continue;
        if(e.fi == i1) continue;
        if(e.fi == i2) continue;
        ll d = l[e.se] + dfsDepth(e.fi,e.se^1);
        res = max(res, d);
        p = combine(p,d);
    }
    curBest = max(curBest, p.fi + p.se);
    return res;
}

void program() {
    IN(n);
    RE1(b,n) {
        int a; IN(a,l[edges]);
        adj[a].pb({b,edges++});
        l[edges] = l[edges-1];
        adj[b].pb({a,edges++});
    }

    ll ans = 0;
    RE1(i,n) {
        if(visited[i]) continue;

        // find the cycle
        curBest = 0;
        cycle.clear();
        dfsVisit(i,-1);

        // fill a, b and c
        ll m = cycle.size(), totB = 0;
        FOR(u,cycle) totB += u.se;

        ll curB = totB;
        ll bestSum1 = -INF, bestSum2 = -INF;
        REV(i,0,m) {
            curB -= cycle[i].se;
            i1 = cycle[(i+1)%m].fi;
            i2 = cycle[(i-1+m)%m].fi;
            ll C = dfsDepth(cycle[i].fi, -1);
            curBest  = max(curBest ,        bestSum1 - curB + C);
            curBest  = max(curBest , totB + bestSum2 + curB + C);
            bestSum1 = max(bestSum1,  curB + C);
            bestSum2 = max(bestSum2, -curB + C);
        }
        ans += curBest;
    }
    OUTL(ans);
}

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23756 KB Output is correct
2 Correct 16 ms 23832 KB Output is correct
3 Correct 17 ms 23804 KB Output is correct
4 Correct 16 ms 23812 KB Output is correct
5 Correct 16 ms 23816 KB Output is correct
6 Correct 15 ms 23780 KB Output is correct
7 Correct 16 ms 23820 KB Output is correct
8 Correct 16 ms 23756 KB Output is correct
9 Correct 16 ms 23756 KB Output is correct
10 Correct 16 ms 23772 KB Output is correct
11 Correct 17 ms 23704 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23804 KB Output is correct
2 Correct 16 ms 23884 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 24012 KB Output is correct
2 Correct 18 ms 24180 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 24668 KB Output is correct
2 Correct 32 ms 26820 KB Output is correct
3 Correct 25 ms 24780 KB Output is correct
4 Correct 20 ms 24268 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 28000 KB Output is correct
2 Correct 49 ms 29956 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 34604 KB Output is correct
2 Correct 95 ms 39588 KB Output is correct
3 Correct 121 ms 49012 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 150 ms 42664 KB Output is correct
2 Correct 204 ms 64564 KB Output is correct
3 Correct 212 ms 70064 KB Output is correct
4 Correct 264 ms 87356 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 325 ms 70868 KB Output is correct
2 Correct 770 ms 112792 KB Output is correct
3 Correct 277 ms 61008 KB Output is correct
4 Correct 375 ms 96764 KB Output is correct
5 Correct 375 ms 97304 KB Output is correct
6 Correct 1083 ms 66764 KB Output is correct
7 Correct 415 ms 131072 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 381 ms 131076 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -