oj.uz

답안 #570744

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
570744 2022-05-31T08:12:48 Z amukkalir Islands (IOI08_islands) C++17
34 / 100
 2000 ms 131072 KB 
#include "bits/stdc++.h"
using namespace std; 

#define pii pair<int, int> 
#define fi first 
#define se second 
#define pb push_back

const int nax = 1e6; 
int n; 
int p[nax+5]; 
bool vis[nax+5]; 
long long c[nax+5]; 
long long val[nax+5]; 
long long psum[nax+5]; 
vector<pii> adj[nax+5]; 
vector<int> cyc[nax+5]; 
vector<pii> edg; 

void gp(int u, int par, int ls=0) {
    p[u] = par; 
    for(pii t : adj[u]) {
        int v = t.fi; 
        int e = t.se; 
        if(e == ls) continue; 

        if(p[v] == 0) {
            gp(v, par, e); 
        } else {
            cyc[par].push_back(e); 
        }
    }
}

bool fc(int u, int go, int ls) {
    if(u == go) return true; 

    for(pii t : adj[u]) {
        int v = t.fi; 
        int e = t.se; 
        if(e == ls) continue; 
        
        bool ok = fc(v, go, e); 
        if(ok) {
            vis[u] = true; 
            vis[v] = true; 
            cyc[p[go]].push_back(e); 
            return true; 
        } 
    }

    return false; 
}

long long trav(int u) {
    if(val[u]) return val[u]; 

    vis[u] = true; 
    long long res = 0; 
    for(pii t : adj[u]) {
        int v = t.fi; 
        int e = t.se; 
        if(!vis[v]) {
            res = max(res, c[e] + trav(v)); 
        }
    }

    return val[u] = res; 
}

long long sum (int l, int r, int i) {
    if(r < l) return psum[r] + psum[cyc[i].size()-1] - psum[l-1]; 
    if(l) return psum[r] - psum[l-1]; 
    return psum[r]; 
}

int main () {
    scanf("%d", &n); 

    edg.pb({0,0}); 
    for(int i=1; i<=n; i++) {
        long long l, j;         
        scanf("%lld %lld", &j, &l); 

        c[i] = l; 
        adj[j].pb({i,i}); 
        adj[i].pb({j,i}); 
        edg.pb({i,j}); 
    }

    long long ans = 0; 
    for(int i=1; i<=n; i++) {
        if(p[i] == 0) {
            gp(i,i); 
            cyc[i].pop_back(); 
            fc(edg[cyc[i][0]].fi, edg[cyc[i][0]].se, cyc[i][0]); 

            long long opt = 0; 
            long long total = 0; 

            for(int q = 0; q < cyc[i].size(); q++) {
                int k = cyc[i][q]; 
                total += c[k]; 
                psum[q] = c[k]; 
                if(q) psum[q] += psum[q-1];
            }

            for(int q=0; q<cyc[i].size(); q++) {
                for(int r=q; r < cyc[i].size(); r++) {
                    int u = edg[cyc[i][q]].fi; 
                    int v = edg[cyc[i][r]].se; 
                    if(u == v) continue; 
                    opt = max(opt, trav(u) + trav(v) + max(sum(q,r, i), total - sum(q,r, i))); 
                }
            }
            ans += opt; 
        }
    }

    printf("%lld", ans); 
}

Compilation message

islands.cpp: In function 'int main()':
islands.cpp:101:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |             for(int q = 0; q < cyc[i].size(); q++) {
      |                            ~~^~~~~~~~~~~~~~~
islands.cpp:108:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |             for(int q=0; q<cyc[i].size(); q++) {
      |                          ~^~~~~~~~~~~~~~
islands.cpp:109:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |                 for(int r=q; r < cyc[i].size(); r++) {
      |                              ~~^~~~~~~~~~~~~~~
islands.cpp:78:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   78 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
islands.cpp:83:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |         scanf("%lld %lld", &j, &l);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
27.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 47208 KB Output is correct
2 Incorrect 33 ms 47300 KB Output isn't correct
3 Correct 30 ms 47276 KB Output is correct
4 Correct 32 ms 47176 KB Output is correct
5 Correct 25 ms 47184 KB Output is correct
6 Correct 25 ms 47240 KB Output is correct
7 Correct 25 ms 47188 KB Output is correct
8 Correct 25 ms 47192 KB Output is correct
9 Correct 25 ms 47188 KB Output is correct
10 Incorrect 24 ms 47272 KB Output isn't correct
11 Correct 27 ms 47316 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 47424 KB Output is correct
2 Correct 31 ms 47340 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 47520 KB Output is correct
2 Correct 57 ms 47824 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 111 ms 48588 KB Output is correct
2 Correct 892 ms 51400 KB Output is correct
3 Correct 36 ms 48968 KB Output is correct
4 Incorrect 32 ms 48100 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1530 ms 52864 KB Output is correct
2 Execution timed out 2091 ms 56604 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1332 ms 62708 KB Output is correct
2 Execution timed out 2062 ms 69816 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2094 ms 70144 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 355 ms 114940 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

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