oj.uz

답안 #922508

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922508 2024-02-05T15:15:26 Z cpptowin Museum (CEOI17_museum) C++17
100 / 100
 558 ms 784612 KB 
#include<bits/stdc++.h>
#define fo(i,d,c) for(int i=d;i<=c;i++)
#define fod(i,c,d) for(int i=c;i>=d;i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout<<"\n";
// #define int long long
#define inf 1000000000
#define pii pair<int,int>
#define vii vector<pii>
#define lb(x) x&-x
#define bit(i,j) ((i>>j)&1)
#define offbit(i,j) (i^(1<<j))
#define onbit(i,j) (i|(1<<j))
#define vi vector<int>
template <typename T1, typename T2> bool minimize(T1 &a, T2 b){if (a > b) {a = b; return true;} return false;}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;} return false;}
using namespace std;
int n,k,x;
vii ke[maxn];
int f[10010][10010][2];
int sz[maxn];
void dfs(int u,int parent)
{
    sz[u] = 1;
    for(auto [v,w] : ke[u])
    {
        if(v == parent) continue;
        dfs(v,u);
        sz[u] += sz[v];
        fod(i,sz[u],2) fo(j,max(0,i - sz[u] + sz[v]),min(i,sz[v])) 
        {
            f[u][i][0] = min(f[u][i][0],f[v][j][1] + f[u][i - j][0] + 2 * w);
            f[u][i][0] = min(f[u][i][0],f[v][j][0] + f[u][i - j][1] + w);
            f[u][i][1] = min(f[u][i][1],f[v][j][1] + f[u][i - j][1] + 2 * w);
        }
    }
}
main()
{
    #define name "TASK"
    if(fopen(name".inp","r"))
    {
       freopen(name".inp","r",stdin);
       freopen(name".out","w",stdout);
    }
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    cin >> n >> k >> x;
    fo(i,1,n - 1)
    {
        int u,v,w;
        cin >> u >> v >> w;
        ke[u].pb(v,w);
        ke[v].pb(u,w);
    }
    fo(i,1,n) fo(j,2,k) f[i][j][0] = f[i][j][1] = inf;
    dfs(x,x);
    cout << f[x][k][0];
}

Compilation message

museum.cpp:42:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   42 | main()
      | ^~~~
museum.cpp: In function 'int main()':
museum.cpp:47:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |        freopen(name".inp","r",stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
museum.cpp:48:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |        freopen(name".out","w",stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 27992 KB Output is correct
2 Correct 7 ms 27996 KB Output is correct
3 Correct 10 ms 27996 KB Output is correct
4 Correct 7 ms 27992 KB Output is correct
5 Correct 7 ms 27996 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 190 ms 324432 KB Output is correct
2 Correct 172 ms 324952 KB Output is correct
3 Correct 329 ms 410624 KB Output is correct
4 Correct 220 ms 349064 KB Output is correct
5 Correct 171 ms 329516 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 190 ms 324432 KB Output is correct
2 Correct 172 ms 324952 KB Output is correct
3 Correct 329 ms 410624 KB Output is correct
4 Correct 220 ms 349064 KB Output is correct
5 Correct 171 ms 329516 KB Output is correct
6 Correct 176 ms 324232 KB Output is correct
7 Correct 259 ms 372284 KB Output is correct
8 Correct 413 ms 324020 KB Output is correct
9 Correct 332 ms 323984 KB Output is correct
10 Correct 191 ms 324340 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 27992 KB Output is correct
2 Correct 7 ms 27996 KB Output is correct
3 Correct 10 ms 27996 KB Output is correct
4 Correct 7 ms 27992 KB Output is correct
5 Correct 7 ms 27996 KB Output is correct
6 Correct 190 ms 324432 KB Output is correct
7 Correct 172 ms 324952 KB Output is correct
8 Correct 329 ms 410624 KB Output is correct
9 Correct 220 ms 349064 KB Output is correct
10 Correct 171 ms 329516 KB Output is correct
11 Correct 176 ms 324232 KB Output is correct
12 Correct 259 ms 372284 KB Output is correct
13 Correct 413 ms 324020 KB Output is correct
14 Correct 332 ms 323984 KB Output is correct
15 Correct 191 ms 324340 KB Output is correct
16 Correct 204 ms 369404 KB Output is correct
17 Correct 302 ms 576592 KB Output is correct
18 Correct 261 ms 396412 KB Output is correct
19 Correct 354 ms 370488 KB Output is correct
20 Correct 210 ms 370964 KB Output is correct
21 Correct 445 ms 784500 KB Output is correct
22 Correct 398 ms 783960 KB Output is correct
23 Correct 558 ms 784184 KB Output is correct
24 Correct 380 ms 784344 KB Output is correct
25 Correct 512 ms 784612 KB Output is correct