oj.uz

Submission #1061943

# Submission time Handle Problem Language Result Execution time Memory
1061943 2024-08-16T15:44:13 Z steveonalex Train (APIO24_train) C++17
5 / 100
 95 ms 29944 KB 
#include <bits/stdc++.h>
#include "train.h" 


using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 1e5 + 65;
const ll INF = 1e18 + 69;
vector<pair<int,ll>> relevant_time[N];
vector<pair<int, int>> graph[N * 2];

void reset(int n, int m, int w){
    for(int i = 0; i<n; ++i) relevant_time[i].clear();
    for(int i = 0; i<n * 2; ++i){
        graph[i].clear();
    }
}

struct FenwickTree{
    int n;
    vector<int> a;

    FenwickTree(int _n){
        n = _n;
        a.resize(n+1);
    }

    void update(int i, int v){
        while(i <= n){
            a[i] += v;
            i += LASTBIT(i);
        }
    }

    int get(int i){
        int ans = 0;
        while(i > 0){
            ans += a[i];
            i -= LASTBIT(i);
        }
        return ans;
    }
};

ll solve(int n, int m, int w, vector<int> t, 
                vector<int> x, vector<int> y, vector<int> a, vector<int> b, vector<int> c, 
                vector<int> l, vector<int> r) {
    reset(n, m, w);

    vector<pair<int, int>> relevant_pair;
    for(int i = 0; i<m; ++i){
        relevant_pair.push_back({a[i], x[i]});
        relevant_pair.push_back({b[i], y[i]});
    }
    relevant_pair.push_back({0, 0});
    relevant_pair.push_back({1e9 + 69, n-1});
    remove_dup(relevant_pair);

    for(int i = 0; i<m; ++i){
        pair<int, int> u = {a[i], x[i]}, v = {b[i], y[i]};
        int idx1 = lower_bound(ALL(relevant_pair), u) - relevant_pair.begin();
        int idx2 = lower_bound(ALL(relevant_pair), v) - relevant_pair.begin();
        graph[idx2].push_back({idx1, c[i]});
    }

    vector<ll> dis(relevant_pair.size(), INF);
    dis[0] = 0;
    for(int i = 0; i < relevant_pair.size(); ++i){
        pair<int, int> u = relevant_pair[i];
        for(pair<int, int> j: graph[i]) minimize(dis[i], dis[j.first] + j.second);
        if (relevant_time[u.second].size()){
            minimize(dis[i], relevant_time[u.second].back().second);
        }
        relevant_time[u.second].push_back({u.first, dis[i]});
    }

    if (dis.back() == INF) return -1;
    return dis.back();
}


// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     clock_t start = clock();

//     int n, m, w; cin >> n >> m >> w;
//     vector<int> t(n), x(m), y(m), a(m), b(m), c(m), l(w), r(w);
//     for(int &i: t) cin >> i;
//     for(int &i: x) cin >> i;
//     for(int &i: y) cin >> i;
//     for(int &i: a) cin >> i;
//     for(int &i: b) cin >> i;
//     for(int &i: c) cin >> i;
//     for(int &i: l) cin >> i;
//     for(int &i: r) cin >> i;

//     cout << solve(n, m, w, t, x, y, a, b, c, l, r) << "\n";


//     cerr << "Time elapsed: " << clock() - start << " ms\n";

//     return 0;
// }

/*
5
4 3 2 1 0
6
0 1
1 2
2 3
3 4
0 1
1 2

*/

Compilation message

train.cpp: In function 'll solve(int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:113:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |     for(int i = 0; i < relevant_pair.size(); ++i){
      |                    ~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 7516 KB Wrong Answer.
2 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 22760 KB Correct.
2 Correct 81 ms 22740 KB Correct.
3 Correct 1 ms 7256 KB Correct.
4 Correct 8 ms 8796 KB Correct.
5 Correct 1 ms 7260 KB Correct.
6 Correct 80 ms 26692 KB Correct.
7 Correct 2 ms 7512 KB Correct.
8 Correct 58 ms 26564 KB Correct.
9 Correct 90 ms 27476 KB Correct.

Subtask #3
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 22760 KB Correct.
2 Correct 81 ms 22740 KB Correct.
3 Correct 1 ms 7256 KB Correct.
4 Correct 8 ms 8796 KB Correct.
5 Correct 1 ms 7260 KB Correct.
6 Correct 80 ms 26692 KB Correct.
7 Correct 2 ms 7512 KB Correct.
8 Correct 58 ms 26564 KB Correct.
9 Correct 90 ms 27476 KB Correct.
10 Incorrect 95 ms 29944 KB Wrong Answer.
11 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 7516 KB Wrong Answer.
2 Halted 0 ms 0 KB -