oj.uz

Submission #1046031

# Submission time Handle Problem Language Result Execution time Memory
1046031 2024-08-06T09:11:37 Z Mher777 Petrol stations (CEOI24_stations) C++17
18 / 100
 30 ms 7260 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937_64 rnd(7069);

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return(max(a, b));
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    if (a > b) return 0ll;
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

bool isPrime(ll a) {
    if (a == 1) return false;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return false;
    }
    return true;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 70005;
int used[N];
ll ans[N], sub[N];
vector<pair<int, ll>> g[N];
int n;
ll k;

void dfs(int u, ll cur = k) {
    used[u] = 1;
    sub[u] = 1;
    for (auto to : g[u]) {
        if (used[to.ff]) continue;
        if (to.ss > cur) {
            dfs(to.ff, k - to.ss);
            ans[u] += sub[to.ff];
        }
        else {
            dfs(to.ff, cur - to.ss);
        }
        sub[u] += sub[to.ff];
    }
}

void slv() {
    cin >> n >> k;
    for (int i = 0; i < n - 1; ++i) {
        int x, y;
        ll c;
        cin >> x >> y >> c;
        ++x, ++y;
        g[x].pub({ y,c });
        g[y].pub({ x,c });
    }
    if (n <= 1000 && k <= 1000) {
        for (int i = 1; i <= n; ++i) {
            dfs(i);
            for (int j = 1; j <= n; ++j) {
                used[j] = sub[j] = 0;
            }
        }
        for (int i = 1; i <= n; ++i) {
            cout << ans[i] << '\n';
        }
        return;
    }
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

Compilation message

Main.cpp: In function 'll range_sum(ll, ll)':
Main.cpp:97:21: warning: unused variable 'cnt' [-Wunused-variable]
   97 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
Main.cpp: In function 'll bin_to_dec(std::string)':
Main.cpp:120:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 6 ms 2700 KB Output is correct
4 Correct 9 ms 2768 KB Output is correct
5 Correct 7 ms 2708 KB Output is correct
6 Correct 12 ms 2856 KB Output is correct
7 Correct 11 ms 2856 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 7 ms 2652 KB Output is correct
10 Correct 10 ms 2652 KB Output is correct
11 Correct 7 ms 2652 KB Output is correct
12 Correct 7 ms 2652 KB Output is correct
13 Correct 7 ms 2648 KB Output is correct
14 Correct 8 ms 2760 KB Output is correct

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2652 KB Output is correct
2 Incorrect 16 ms 7260 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 0 ms 2652 KB Output is correct
4 Incorrect 16 ms 7260 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Incorrect 30 ms 7120 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Incorrect 30 ms 7120 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 6 ms 2700 KB Output is correct
4 Correct 9 ms 2768 KB Output is correct
5 Correct 7 ms 2708 KB Output is correct
6 Correct 12 ms 2856 KB Output is correct
7 Correct 11 ms 2856 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 7 ms 2652 KB Output is correct
10 Correct 10 ms 2652 KB Output is correct
11 Correct 7 ms 2652 KB Output is correct
12 Correct 7 ms 2652 KB Output is correct
13 Correct 7 ms 2648 KB Output is correct
14 Correct 8 ms 2760 KB Output is correct
15 Correct 0 ms 2652 KB Output is correct
16 Incorrect 16 ms 7260 KB Output isn't correct
17 Halted 0 ms 0 KB -