제출 #1307292

#제출 시각아이디문제언어결과실행 시간메모리
1307292opeleklanos사탕 분배 (IOI21_candies)C++20
컴파일 에러
0 ms0 KiB
#include <iostream> #include <vector> #include <algorithm> #include "candies.h" using namespace std; #define ll long long ll n; vector<ll> segTree; vector<ll> s; void update(ll indx, ll l, ll r, ll a, ll b, ll x){ if(a<=l && r<=b){ segTree[indx] += x; return; } ll mid = (l+r)/2; if(a<=mid) update(indx*2+1, l, mid, a, min(mid, b), x); if(b>mid) update(indx*2+2, mid+1, r, max(mid+1, a), b, x); } void buildS(ll indx, ll l, ll r){ if(l == r && l<n && l>=0){ s[l] = segTree[indx]; return; } ll mid = (l+r)/2; segTree[indx*2+1] += segTree[indx]; segTree[indx*2+2] += segTree[indx]; segTree[indx] = -1; buildS(indx*2+1, l, mid); buildS(indx*2+2, mid+1, r); return; } vector<ll> distribute_candies(vector<ll> c, vector<ll> l, vector<ll> r, vector<ll> v){ s.assign(c.size(), 0); n = c.size(); segTree.assign(n*3, 0); for(ll i = 0; i<l.size(); i++){ update(0, 0, n-1, l[i], r[i], v[i]); } buildS(0, 0, n-1); vector<int> ans(n, 0); for(ll i = 0; i<n; i++) ans[i] = min(s[i], c[i]); return ans; } // ll main(void){ // freopen("input.txt", "r", stdin); // ll ni, qu; // cin>>ni>>qu; // vector<ll> c1(ni), l1(qu), r1(qu), v1(qu); // for(ll i = 0; i<ni; i++) cin>>c1[i]; // for(ll i = 0; i<qu; i++) cin>>l1[i]>>r1[i]>>v1[i]; // // for(ll i = 0; i<qu; i++) cin>>r1[i]; // // for(ll i = 0; i<qu; i++) cin>>v1[i]; // vector<ll> ans = distribute_candies(c1, l1, r1, v1); // for(auto i : ans) cout<<i<<endl; // }

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

candies.cpp: In function 'std::vector<long long int> distribute_candies(std::vector<long long int>, std::vector<long long int>, std::vector<long long int>, std::vector<long long int>)':
candies.cpp:47:12: error: could not convert 'ans' from 'vector<int>' to 'vector<long long int>'
   47 |     return ans;
      |            ^~~
      |            |
      |            vector<int>