제출 #1240693

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1240693		dosts	봉쇄 시간 (IOI23_closing)	C++20	0 / 100	1134 ms	1665880 KiB

closing

#include "closing.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 2e5+1, inf = 2e18;

vector<pii> edges[LIM];
vi distX(LIM),distY(LIM);
void dfs(int node,int p,int flag,int cur = 0) {
    if (!flag) distX[node] = cur;
    else distY[cur] = cur;
    for (auto it : edges[node]) {
        if (it.ff == p) continue;
        dfs(it.ff,node,flag,cur+it.ss);
    }
}

signed max_score(signed N, signed X, signed Y, int K,
              std::vector<signed> U, std::vector<signed> V, std::vector<signed> W)
{
    int M = big(U);
    for (int i = 0;i<M;i++) { 
        edges[U[i]].push_back({V[i],W[i]});
        edges[V[i]].push_back({U[i],W[i]});
    }
    dfs(X,X,0),dfs(Y,Y,1);
    if (distX[Y] > 2*K) {
        vi v;
        for (int i = 0;i<N;i++) v.push_back(distX[i]),v.push_back(distY[i]);
        sort(all(v));
        int ans = 0;
        for (auto it : v) {
            if (it <= K) {
                K-=it;
                ans++;
            }else break;
        }
        return ans;
    }
}

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

closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:49:1: warning: control reaches end of non-void function [-Wreturn-type]
   49 | }
      | ^

• Subtask 0: 0 / 0
• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 9
• Subtask 6: 0 / 11
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 17