제출 #1098817

#제출 시각아이디문제언어결과실행 시간메모리
1098817KasymK봉쇄 시간 (IOI23_closing)C++17
컴파일 에러
0 ms0 KiB
#include "bits/stdc++.h" using namespace std; #define ff first #define ss second #define all(v) v.begin(), v.end() #define ll long long #define pb push_back #define pii pair<int, int> #define pli pair<ll, int> #define pll pair<ll, ll> #define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i) #define wr puts("----------------") template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;} template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;} const int N = 2e5+5; vector<pii> adj[N]; ll dis[N]; int max_score(int n, int x, int y, ll k, vector<int> u, vector<int> v, vector<int> w) { for(int i = 0; i < n-1; ++i) adj[u[i]+1].pb({v[i]+1, w[i]}), adj[v[i]+1].pb({u[i]+1, w[i]}) vector<ll> A; vector<int> D; D.pb(x), D.pb(y); for(int ad : D){ memset(dis, -1, sizeof dis); queue<int> q; q.push(ad); dis[ad] = 0; while(!q.empty()){ int x = q.front(); q.pop(); for(auto i : adj[x]) if(dis[i.ff] == -1) dis[i.ff] = dis[x]+1, q.push(i.ff); } for(int i = 1; i <= n; ++i) if(~dis[i]) A.pb(dis[i]); } ll sm = 0; for(int i = 0; i <= (int)A.size(); ++i) if(i == (int)A.size() or (sm+=v[i])>k) return i; }

컴파일 시 표준 에러 (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:21:71: error: expected ';' before 'vector'
   21 |         adj[u[i]+1].pb({v[i]+1, w[i]}), adj[v[i]+1].pb({u[i]+1, w[i]})
      |                                                                       ^
      |                                                                       ;
   22 |     vector<ll> A;
      |     ~~~~~~                                                             
closing.cpp:39:17: error: 'A' was not declared in this scope
   39 |                 A.pb(dis[i]);
      |                 ^
closing.cpp:42:30: error: 'A' was not declared in this scope
   42 |     for(int i = 0; i <= (int)A.size(); ++i)
      |                              ^