제출 #777364

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
777364		dxz05	Vinjete (COI22_vinjete)	C++17	11 / 100	230 ms	524288 KiB

Main

#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx,avx2")

#include <bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)
#define MP make_pair
//#define endl '\n'

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

typedef long long ll;
const int MOD = 1e9 + 7;
const int N = 5e4 + 2;

vector<tuple<int, int, int>> g[N];

bitset<N> full;
bitset<N> b;

int ans[N];
void dfs(int v, int p, bitset<N> cur){
    ans[v] = (int) cur.count();

    for (auto [u, l, r] : g[v]){
        if (u == p) continue;
        int k = r - l + 1;

        b = cur | ((full >> l) << (N - k) >> (N - k - l));
        dfs(u, v, b);
    }
}

void solve(){
    int n, m;
    cin >> n >> m;

    for (int i = 1; i < n; i++){
        int u, v, l, r;
        cin >> u >> v >> l >> r;
        g[u].emplace_back(v, l, r);
        g[v].emplace_back(u, l, r);
    }

    full.set();

    dfs(1, -1, bitset<N>());

    for (int i = 2; i <= n; i++) cout << ans[i] << endl;

}

int main(){
    clock_t startTime = clock();
    ios_base::sync_with_stdio(false);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int test_cases = 1;
//    cin >> test_cases;

    for (int test = 1; test <= test_cases; test++){
        // cout << (solve() ? "YES" : "NO") << endl;
        solve();
    }

#ifdef LOCAL
    cerr << "Time: " << int((double) (clock() - startTime) / CLOCKS_PER_SEC * 1000) << " ms" << endl;
#endif

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'int main()':
Main.cpp:59:13: warning: unused variable 'startTime' [-Wunused-variable]
   59 |     clock_t startTime = clock();
      |             ^~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 0 / 13
• Subtask 3: 0 / 16
• Subtask 4: 0 / 29
• Subtask 5: 0 / 31