oj.uz

Submission #992516

# Submission time Handle Problem Language Result Execution time Memory
992516 2024-06-04T14:25:05 Z PedroBigMan Islands (IOI08_islands) C++14
90 / 100
 537 ms 131072 KB 
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <list>
#include <iomanip>
#include <stdlib.h>
#include <time.h>
#include <cstring>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=(ll) a; i<(ll) b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define whole(x) x.begin(),x.end()
#define DEBUG(i) cout<<"Pedro "<<i<<endl
#define INF 1000000000000000000LL
#define EPS ((ld)0.00000000001)
#define pi ((ld)3.141592653589793)
#define VV(vvvv,NNNN,xxxx); REP(iiiii,0,NNNN) {vvvv.pb(xxxx);}
ll mod=1000000007;

template<class A=ll> 
void Out(vector<A> a) {REP(i,0,a.size()) {cout<<a[i]<<" ";} cout<<endl;}

template<class A=ll>
void In(vector<A> &a, ll N) {A cur; REP(i,0,N) {cin>>cur; a.pb(cur);}} 

vector<ll> f, w; vector<bool> visited;
vector<vector<ll> > adj; ll nei;
ll bestpath;
vector<ll> rm;

vector<ll> Floyd(ll s) //Floyd's Algorithm, O(N) time, O(1) memory, return <element of cycle,length od cycle>
{
    ll a=f[s]; ll b=f[f[s]];
    while(a!=b) {a=f[a]; b=f[f[b]];}
    vector<ll> ans; ans.pb(a); b=f[a];
    while(b!=a) {ans.pb(b); b=f[b];}
    return ans;
}

ll DFS(ll s)
{
    visited[s]=true; ll ans = 0; ll thisval;
    REP(i,0,adj[s].size())
    {
        nei = adj[s][i];
        if(visited[nei]) {continue;}
        thisval = w[nei]+DFS(nei);
        bestpath = max(bestpath,ans+thisval);
        ans = max(ans,thisval);
    }
    return ans;
}

void Rolling_Max(vector<ll>& a, ll M) //ans[i]=j means aj<ai, j<i and j is the largest that fullfills these conditions. If no j exists then a[i]=-1. 
{
	deque<int> chain; 
    REP(i,0,a.size())
    {
        while(chain.size()>0 && a[i]>=a[chain[chain.size()-1]]) {chain.pop_back();}
        chain.pb(i);
        if(chain.front()==i-M) {chain.pop_front();}
        rm[i]=a[chain.front()];
    }	
} 


int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
	cout.precision(20);
	ll N; cin>>N; f = vector<ll>(N,-1); w = vector<ll>(N,-1); visited = vector<bool>(N,false); adj=vector<vector<ll> >(N,vector<ll>());
    REP(i,0,N) {cin>>f[i]>>w[i]; f[i]--; adj[i].pb(f[i]); adj[f[i]].pb(i);}
    ll ans = 0LL; ll node; ll C; rm = vector<ll>(2*N,0);
    REP(s,0,N)
    {
        if(visited[s]) {continue;}
        ll bestval = 0; ll thisval;
        vector<ll> cycle = Floyd(s); C = cycle.size();
        REP(i,0,cycle.size()) {node=cycle[i]; visited[node]=true;}
        vector<ll> val(C,0);
        REP(i,0,cycle.size()) 
        {
            bestpath = 0;
            val[i]=DFS(cycle[i]);
            bestval = max(bestval,bestpath);
        }
        vector<ll> ps; ll cursum=0;
        REP(i,0,2*C) {node = cycle[i%C]; ps.pb(cursum+val[i%C]); cursum+=w[node];}
        Rolling_Max(ps,C-1);
        REP(i,0,C)
        {
            thisval=rm[i+C-1] -(ps[i]-val[i])+val[i];
            bestval = max(thisval,bestval);
        }
        ans+=bestval;
    }
    cout<<ans<<endl;
    return 0;
}

Compilation message

islands.cpp:1: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    1 | #pragma GCC optimization ("O3")
      | 
islands.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 1 ms 860 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1884 KB Output is correct
2 Correct 9 ms 4412 KB Output is correct
3 Correct 10 ms 2408 KB Output is correct
4 Correct 5 ms 1372 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 5976 KB Output is correct
2 Correct 20 ms 10468 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 19584 KB Output is correct
2 Correct 80 ms 24968 KB Output is correct
3 Correct 61 ms 31044 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 37288 KB Output is correct
2 Correct 114 ms 54504 KB Output is correct
3 Correct 125 ms 64540 KB Output is correct
4 Correct 156 ms 74936 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 94352 KB Output is correct
2 Correct 429 ms 110328 KB Output is correct
3 Correct 164 ms 74484 KB Output is correct
4 Correct 243 ms 106816 KB Output is correct
5 Correct 209 ms 109908 KB Output is correct
6 Correct 537 ms 88460 KB Output is correct
7 Correct 214 ms 120384 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 193 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -