oj.uz

Submission #54992

# Submission time Handle Problem Language Result Execution time Memory
54992 2018-07-05T17:10:17 Z kdh9949 Islands (IOI08_islands) C++17
70 / 100
 1396 ms 132096 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pil = pair<int, ll>;
using pll = pair<ll, ll>;
using pili = pair<pil, int>;
using pli = pair<ll, int>;
#define X first
#define Y second

const int N = 1000005;
const ll INF = ll(1e18);

vector<pili> e[N];

int n, v[N], o[N], c, p[N], q[N];
vector<int> w;
vector<ll> d;
ll a[2 * N], b[2 * N], r, u[N];

void f(int x, int y){
    if(q[x]){
        p[c] = -1;
        for(int i = c - 1; p[i + 1] != x; i--){
            w.push_back(p[i]); d.push_back(u[i]);
            o[p[i]] = 1;
        }
        return;
    }
    if(v[x]) return;
    v[x] = 1;
    int r = 0;
    for(pili i : e[x]){
        if(i.Y == y) continue;
        q[x] = 1; p[c] = x; u[c] = i.X.Y; c++;
        f(i.X.X, i.Y);
        q[x] = 0; c--;
    }
}

ll g(int x, int p, ll &t){
    pll r = {0, 0};
    for(pili i : e[x]){
        if(o[i.X.X] || i.X.X == p) continue;
        ll z = g(i.X.X, x, t) + i.X.Y;
        if(z >= r.X){ r.Y = r.X; r.X = z; }
        else if(z > r.Y) r.Y = z;
    }
    t = max(t, r.X + r.Y);
    return r.X;
}

int main(){
    scanf("%d", &n);
    for(int i = 1; i <= n; i++){
        int x; ll y;
        scanf("%d%lld", &x, &y);
        e[i].push_back(pili(pil(x, y), i));
        e[x].push_back(pili(pil(i, y), i));
    }
    for(int i = 1; i <= n; i++){
        if(v[i]) continue;
        w.clear(); d.clear();
        f(i, 0);
        int s = w.size();
        ll t = 0;
        for(int j = 0; j < s; j++){
            a[j] = a[j + s] = g(w[j], 0, t);
            b[j] = d[j] + (j ? b[j - 1] : 0);
        }
        for(int j = 0; j < s; j++) b[j + s] = b[j + s - 1] + d[j];
        priority_queue<pli> lq, rq;
        for(int j = 1; j < s; j++) rq.push({a[j] + b[j], j});
        for(int j = 0, k = 0; j < s; j++){
            while(k < j + s && b[k] - b[j] < b[j + s] - b[k]) k++;
            while(!rq.empty() && rq.top().Y < k){
                int x = rq.top().Y;
                lq.push({a[x] - b[x], x});
                rq.pop();
            }
            while(!lq.empty() && lq.top().Y <= j) lq.pop();
            t = max(t, max((lq.empty() ? -INF : lq.top().X) + b[j + s],
                           (rq.empty() ? -INF : rq.top().X) - b[j]) + a[j]);
            rq.push({a[j + s] + b[j + s], j + s});
        }
        r += t;
    }
    printf("%lld\n", r);
}

Compilation message

islands.cpp: In function 'void f(int, int)':
islands.cpp:33:9: warning: unused variable 'r' [-Wunused-variable]
     int r = 0;
         ^
islands.cpp: In function 'int main()':
islands.cpp:55:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
islands.cpp:58:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%lld", &x, &y);
         ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 23800 KB Output is correct
2 Correct 22 ms 24048 KB Output is correct
3 Correct 20 ms 24124 KB Output is correct
4 Correct 22 ms 24124 KB Output is correct
5 Correct 25 ms 24124 KB Output is correct
6 Correct 23 ms 24144 KB Output is correct
7 Correct 20 ms 24144 KB Output is correct
8 Correct 23 ms 24276 KB Output is correct
9 Correct 25 ms 24276 KB Output is correct
10 Correct 24 ms 24276 KB Output is correct
11 Correct 25 ms 24276 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 24400 KB Output is correct
2 Correct 28 ms 24428 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 24448 KB Output is correct
2 Correct 27 ms 24952 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 26212 KB Output is correct
2 Correct 71 ms 30092 KB Output is correct
3 Correct 41 ms 30092 KB Output is correct
4 Correct 30 ms 30092 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 33408 KB Output is correct
2 Correct 82 ms 38496 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 48380 KB Output is correct
2 Correct 193 ms 61684 KB Output is correct
3 Correct 228 ms 79596 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 244 ms 79596 KB Output is correct
2 Correct 361 ms 114580 KB Output is correct
3 Runtime error 519 ms 132096 KB Memory limit exceeded 132096 {'time-wall': '0.598', 'max-rss': '115308', 'csw-forced': '181', 'cg-mem': '132096', 'time': '0.519', 'csw-voluntary': '3'} 131072
4 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 518 ms 132096 KB Memory limit exceeded 132096 {'time-wall': '0.580', 'max-rss': '83564', 'csw-forced': '158', 'cg-mem': '132096', 'time': '0.518', 'csw-voluntary': '7'} 131072
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1396 ms 132096 KB Memory limit exceeded 132096 {'time-wall': '3.389', 'max-rss': '132464', 'csw-forced': '593', 'cg-mem': '132096', 'time': '1.396', 'csw-voluntary': '8183'} 131072
2 Halted 0 ms 0 KB -