oj.uz

답안 #877282

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
877282 2023-11-23T05:33:22 Z mgl_diamond Janjetina (COCI21_janjetina) C++17
110 / 110
 212 ms 14028 KB 
// Onegai no bug
// Author : 13minusone
#include<bits/stdc++.h>
using namespace std;
#define task "test"
#define SZ(c) (c).size()
#define getbit(x,i) (((x) >> (i)) & 1)
#define turnoff(x,i) (x)&(~(1<<(i)))
#define __builtin_popcount __builtin_popcountll
#define all(x) (x).begin(),(x).end()
#define pb(x) push_back(x)
#define eb(x) emplace_back(x)
#define TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define fi first
#define se second
#define FOR(i,l,r) for(int i = l ; i <= r ; i++)
#define FD(i,l,r) for(int i = l ; i >= r ; i--)
#define REP(i,l,r) for(int i = l ; i <r ; i++)

typedef long long ll ;
typedef pair<int,int> ii;
template <class T>
inline bool minimize(T &a, const T &b) { return (a > b ? (a = b),1 : 0); }
template <class T>
inline bool maximize(T &a, const T &b) { return (a < b ? (a = b),1 : 0); }

const int N = 1e5+ 5;
//const ll MOD =1e17+9;
//const ll base = 311;
//const int BLOCK = 488;
//const int INF = 1e9 + 7;
int n, k, sz[N], cnt[N], maxx = 0,BIT[N + 20];
ll ans = 0;
vector<ii>edge[N];
bool vis[N];
void updA(int x, int val)
{
    if(x == 0)return;
    for(;x <= maxx; x += (x &(-x)))
        BIT[x] += val;
    return;
}
void updD(int x)
{
    if(x == 0)return;
    for(;x <= maxx; x += (x &(-x)))
        BIT[x] = 0;
    return;
}
int getVal(int x)
{
    if(x == 0)return 0;
    int ans = 0;
    for(;x > 0; x-= (x & (-x)))
        ans += BIT[x];
    return ans;
}
vector<ii>val;
void dfs(int u, int pre, int Maxw, int depth = 1)
{
    maximize(maxx, depth);
    val.pb(ii(Maxw, depth));
    //cout << u << " " << pre <<" "<<  depth << " " << getVal(k2 - depth) - getVal(max(0,k1 -depth - 1)) << endl;
    for(ii &v : edge[u])if(v.fi != pre && !vis[v.fi])
        dfs(v.fi, u, max(Maxw, v.se), depth + 1);
}
int getSZ(int u, int pre)
{
    if(vis[u])return 0;
    sz[u] = 1;
    for(ii &v : edge[u])if(v.fi != pre && !vis[v.fi])
    {
        sz[u] += getSZ(v.fi, u);
    }
    return sz[u];
}
int getCentroid(int u, int Sizetree, int p)
{
    for(ii &v : edge[u])
        if(v.fi != p && !vis[v.fi] && sz[v.fi] * 2 > Sizetree)
            return getCentroid(v.fi,Sizetree, u);
    return u;
}
void CreateCentroid(int u, int pre)
{
    u = getCentroid(u, getSZ(u, -1), -1);
    vis[u] = 1;
    //cout << u << " " << pre << endl;
    maxx = 0;
    for(ii &v : edge[u])if(v.fi != pre && !vis[v.fi])
        dfs(v.fi, u, v.se);
    sort(all(val));
    for(ii &i : val)
    {

        if(i.fi >= i.se){
            ans++;
            ans += getVal(min(maxx,i.fi - i.se));
        }
        updA(i.se, 1);
        //cout << i.fi << " " << i.se << " " << ans << endl;
    }
    //cout << ans << endl;
    val.clear();
    FOR(i,1,maxx)
        updD(i);
    maxx = 0;
    for(ii &v : edge[u])if(v.fi != pre && !vis[v.fi]){
        dfs(v.fi, u, v.se);
        sort(all(val));
        for(ii &i : val)
        {
            if(i.fi >= i.se){
                ans -= getVal(min(maxx, i.fi - i.se));
                //ans++;
            }
            updA(i.se, 1);
        }

        FOR(i,1,maxx)
            updD(i);
        val.clear();
        maxx = 0;
    }
//    cout << endl;
//    FOR(i,0,5)
//        cout << BIT[i] <<" " ;
//    cout << endl;
    //cout << ans << endl;
    for(ii &v : edge[u])if(v.fi != pre && !vis[v.fi])
        CreateCentroid(v.fi, u);
}
void init(void)
{
    cin >> n >> k;
    memset(vis,0, n + 1);
    memset(BIT,0, n + 20);
    FOR(i,1,n-1)
    {
        register int u, v, w;
        cin >> u >> v >> w;
        w -= k;
        edge[u].pb(ii(v,w));
        edge[v].pb(ii(u,w));
    }
}
void process(void)
{
    CreateCentroid(1,-1);
    cout << ans * 2LL;
}
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if(fopen(task".inp","r"))
    {
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    int t = 1;
    //cin >> t;
    while(t--)
    {
        init();
        process();
    }
    cerr << "TIME : " << TIME << "s\n";
}

Compilation message

Main.cpp: In function 'void init()':
Main.cpp:140:22: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
  140 |         register int u, v, w;
      |                      ^
Main.cpp:140:25: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
  140 |         register int u, v, w;
      |                         ^
Main.cpp:140:28: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
  140 |         register int u, v, w;
      |                            ^
Main.cpp: In function 'int main()':
Main.cpp:158:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  158 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:159:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  159 |         freopen(task".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 1 ms 2904 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 2 ms 2728 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2884 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 2 ms 2904 KB Output is correct
5 Correct 14 ms 3928 KB Output is correct
6 Correct 90 ms 8412 KB Output is correct
7 Correct 172 ms 13768 KB Output is correct
8 Correct 184 ms 13764 KB Output is correct
9 Correct 212 ms 13796 KB Output is correct
10 Correct 198 ms 13772 KB Output is correct
11 Correct 171 ms 13804 KB Output is correct
12 Correct 186 ms 13792 KB Output is correct
13 Correct 189 ms 13776 KB Output is correct
14 Correct 201 ms 13772 KB Output is correct
15 Correct 204 ms 14020 KB Output is correct
16 Correct 186 ms 13780 KB Output is correct
17 Correct 187 ms 13776 KB Output is correct
18 Correct 186 ms 13772 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 1 ms 2904 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 2 ms 2728 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2884 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 1 ms 2652 KB Output is correct
26 Correct 2 ms 2904 KB Output is correct
27 Correct 14 ms 3928 KB Output is correct
28 Correct 90 ms 8412 KB Output is correct
29 Correct 172 ms 13768 KB Output is correct
30 Correct 184 ms 13764 KB Output is correct
31 Correct 212 ms 13796 KB Output is correct
32 Correct 198 ms 13772 KB Output is correct
33 Correct 171 ms 13804 KB Output is correct
34 Correct 186 ms 13792 KB Output is correct
35 Correct 189 ms 13776 KB Output is correct
36 Correct 201 ms 13772 KB Output is correct
37 Correct 204 ms 14020 KB Output is correct
38 Correct 186 ms 13780 KB Output is correct
39 Correct 187 ms 13776 KB Output is correct
40 Correct 186 ms 13772 KB Output is correct
41 Correct 1 ms 2648 KB Output is correct
42 Correct 171 ms 13792 KB Output is correct
43 Correct 184 ms 13792 KB Output is correct
44 Correct 188 ms 13828 KB Output is correct
45 Correct 196 ms 13780 KB Output is correct
46 Correct 171 ms 13732 KB Output is correct
47 Correct 183 ms 13780 KB Output is correct
48 Correct 199 ms 13792 KB Output is correct
49 Correct 202 ms 13776 KB Output is correct
50 Correct 200 ms 13780 KB Output is correct
51 Correct 194 ms 14028 KB Output is correct
52 Correct 60 ms 8660 KB Output is correct
53 Correct 62 ms 8660 KB Output is correct
54 Correct 46 ms 8660 KB Output is correct
55 Correct 64 ms 8660 KB Output is correct
56 Correct 77 ms 8652 KB Output is correct
57 Correct 152 ms 8144 KB Output is correct
58 Correct 143 ms 8144 KB Output is correct
59 Correct 132 ms 8152 KB Output is correct
60 Correct 163 ms 8148 KB Output is correct
61 Correct 156 ms 8144 KB Output is correct
62 Correct 127 ms 8136 KB Output is correct
63 Correct 130 ms 8160 KB Output is correct
64 Correct 141 ms 8144 KB Output is correct
65 Correct 6 ms 2904 KB Output is correct
66 Correct 1 ms 2648 KB Output is correct