oj.uz

답안 #1001517

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1001517 2024-06-19T05:16:01 Z farrellw 사탕 분배 (IOI21_candies) C++17
3 / 100
 61 ms 11856 KB 
#include "candies.h"
using namespace std;

#include <vector>


vector<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);

    if(n <= 2000 && q <= 2000) {
    	for(int i = 0; i < q; i++) {
    		for(int j = l[i]; j <= r[i]; j++) {
    			s[j] = s[j] + v[i];
    			if(s[j] < 0) {
    				s[j] = 0;
    			}
    			if(s[j] > c[j]) {
    				s[j] = c[j];
    			}
    		}
    	}
    }

    return s;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 348 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 34 ms 7512 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 30 ms 7720 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Incorrect 61 ms 11856 KB Output isn't correct
7 Halted 0 ms 0 KB -