oj.uz

답안 #530457

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
530457 2022-02-25T11:52:38 Z Icebear16 사탕 분배 (IOI21_candies) C++17
0 / 100
 5000 ms 8352 KB 
#include "candies.h"
#include <vector>
#include <algorithm>

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r, std::vector<int> v) {
    int n=c.size();
    int q=l.size();
    std::vector<int> s(n,0);
    bool flag=true;
    for(int i=0;i<q;i++){
    	if(v[i]<0){
    		flag=false;
    		break;
		}
	}
	if(flag==false){
		for(int j=0;j<q;j++){
			for(int i=l[j];i<=r[j];i++){
				if(v[j]>=0){
					if(c[i]>(s[i]+v[j])) s[i]+=v[j];
					else s[i]=c[i];
				}else{
					if((s[i]+v[j])<0) s[i]=0;
					else s[i]+=v[j];
				}
			}
		}
	}else{
		s.push_back(0);
		int h=0,k=0;
		for(int j=0;j<q;j++){
			h=l[j];
			s[h]+=v[j];
			k=r[j];
			s[k+1]-=v[j];
		}
		for(int i=1;i<=n;i++){
			s[i]+=s[i-1];
		}
		s.pop_back();
		for(int i=0;i<n;i++){
			if(s[i]>c[i]){
				s[i]=c[i];
			}
		}
	}
    return s;
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 90 ms 8352 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 157 ms 5192 KB Output is correct
3 Correct 160 ms 4068 KB Output is correct
4 Execution timed out 5016 ms 7492 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 376 ms 5144 KB Output is correct
4 Correct 380 ms 3036 KB Output is correct
5 Execution timed out 5058 ms 7492 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -