Submission #1051497

#	Time	Username	Problem	Language	Result	Execution time	Memory
1051497		mindiyak	Jobs (BOI24_jobs)	C++14	0 / 100	835 ms	1048576 KiB

Main

#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<pi>> vvpi;
typedef vector<ld> vd;
typedef vector<long long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (ll 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 trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1e9+7;
void init(string name)
{
    freopen((name + ".in").c_str(), "r", stdin);
    freopen((name + ".out").c_str(), "w", stdout);
}
void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
}
 
int N = 4e5;
vi parent (N,0);
vector<set<int>> sons(N, set<int>());
queue<int> roots;
vl profit(N,0);
vi visited(N,0);
 
ll ans = 0;
 
void proc(int pos,ll money,vi path,set<int> pathset){
    money += profit[pos];

    path.pb(pos);
    pathset.insert(pos);
 
    if(money > ans){
        ans = money;
        FOR(i,0,path.size()){
            for(int a:sons[path[i]]){
                if(pathset.count(a) == 0)
                    roots.push(a);
            }
        }
        return;
    }
 
    for(int a:sons[pos]){
        proc(a,money,path,pathset);
    }
}
 
 
void solve()
{
    int n;ll s;cin >> n >> s;
 
    FOR(i,0,n){
        ll a;int b;cin >> a >> b;
        b --;
        if(b == -1){
            roots.push(i);
        }else{
            parent[i] = b;
            sons[b].insert(i);
        }
        profit[i] = a;
    }

    while(!roots.empty()){
        int a = roots.front();roots.pop();
        vi path;set<int> pathset;
        proc(a,ans,path,pathset);
    }
 
    cout << ans << endl;
 
}
 
 
int main()
{
    fastIO();
    // init("test");
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}

Compilation message (stderr)

Main.cpp: In function 'void proc(int, ll, vi, std::set<int>)':
Main.cpp:24:39: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 | #define FOR(i, a, b) for (ll i = a; i < (b); i++)
      |                                       ^
Main.cpp:70:9: note: in expansion of macro 'FOR'
   70 |         FOR(i,0,path.size()){
      |         ^~~
Main.cpp: In function 'void init(std::string)':
Main.cpp:44:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     freopen((name + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     freopen((name + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 11
• Subtask 2: 0 / 14
• Subtask 3: 0 / 15
• Subtask 4: 0 / 29
• Subtask 5: 0 / 31