제출 #560195

#제출 시각아이디문제언어결과실행 시간메모리
560195armashka도로 폐쇄 (APIO21_roads)C++17
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #pragma comment(linker, "/stack:200000000") #pragma GCC optimize("Ofast") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout); #define nano chrono::steady_clock::now().time_since_epoch().count() #define uid uniform_int_distribution<int> #define all(v) v.begin(),v.end() #define rall(v) v.rbegin(),v.rend() #define pb push_back #define sz size() #define ft first #define sd second using namespace std; typedef long long ll; typedef pair<ll, ll> pll; typedef unsigned long long ull; const int N = 2e5 + 10; const int M = 2e3 + 5; const ll inf = 1e15; const ll mod = 998244353; const double Pi = acos(-1); ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;} ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;} ll random(ll l, ll r) { mt19937 rnd(nano); uid dist(l, r); return dist(rnd); } ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); } bool odd(ll n) { return (n % 2 == 1); } bool even(ll n) { return (n % 2 == 0); } int n; vector <ll> minimum_closure_costs(int N, vector <int> U, vector <int> V, vector <int> W) { int ans = 0; vector <int> res; sort(all(W)); res.pb(0); for (int i = 0; i < N - 1; ++ i) { ans += W[i]; res.pb(ans); } reverse(all(res)); return res; } //signed main() { // vector <int> cur = minimum_closure_costs(4, {0, 2, 0}, {1, 0, 3}, {5, 10, 5}); // for (auto x : cur) cout << x << " "; //}

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

roads.cpp:5: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    5 | #pragma comment(linker, "/stack:200000000")
      | 
roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:50:9: error: could not convert 'res' from 'vector<int>' to 'vector<long long int>'
   50 |  return res;
      |         ^~~
      |         |
      |         vector<int>