제출 #436181

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
436181		Bom164	사탕 분배 (IOI21_candies)	C++17	0 / 100	105 ms	13092 KiB

candies

#include<bits/stdc++.h>
#include<iostream>

using namespace std;

#define ll              long long
#define pb              push_back
#define mp              make_pair
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define mod             1000000007
#define inf             1e18
#define w(x)            int x; cin>>x; while(x--)

int distribute_candies(vector<int> c,vector<int> l,vector<int> r,vector<int> v){
    int n=c.size();
    int q=l.size();
    vector<int> s(n);
    for(int i=0;i<q;i++){
        int left=l[i];
        int right=r[i];
        for(int j=left;j<=right;j++){
            if(v[i]>0){
                c[j]=min(c[j],0+v[i]);
            }else{
                c[j]=max(0,c[j]+v[i]);
            }
        }
    }
    s=c;
    for(int i=0;i<n;i++){
        cout<<s[i]<<" ";
    }
    cout<<endl;
}

/*int main(){
    //freopen("4.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    int n;
    cin>>n;
    vector<int> c(n);
    for(int i=0;i<n;i++){
        cin>>c[i];
    }
    int q;
    cin>>q;
    vector<int> l(q),r(q),v(q);
    for(int i=0;i<q;i++){
        cin>>l[i];
    }
    for(int i=0;i<q;i++){
        cin>>r[i];
    }
    for(int i=0;i<q;i++){
        cin>>v[i];
    }
    distribute_candies(c,l,r,v);
}*/

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

candies.cpp: In function 'int distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:38:1: warning: no return statement in function returning non-void [-Wreturn-type]
   38 | }
      | ^

• Subtask 1: 0 / 3
• Subtask 2: 0 / 8
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 33