oj.uz

답안 #831834

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831834 2023-08-20T15:53:05 Z Essa2006 사탕 분배 (IOI21_candies) C++17
3 / 100
 5000 ms 13272 KB 
#include<bits/stdc++.h>
#include "candies.h"
using namespace std;
#define ll long long 
#define FF first
#define SS second
#define all(a) a.begin(), a.end()
#define mod (ll)(1000000007)

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
    int n=c.size(), q=l.size();
    vector<int>p(n);
    if((ll)n*q<=1e8){
        for(int i=0;i<n;i++){
            for(int j=0;j<q;j++){
                if(i>=l[j] && i<=r[j]){
                    p[i]=min(c[i], max(0, p[i]+v[j]));
                }
            }
        }
        return p;
    }
    
}

//int main() {
//    int n;
//    assert(1 == scanf("%d", &n));
//    std::vector<int> c(n);
//    for(int i = 0; i < n; ++i) {
//        assert(scanf("%d", &c[i]) == 1);
//    }
//
//    int q;
//    assert(1 == scanf("%d", &q));
//    std::vector<int> l(q), r(q), v(q);
//    for(int i = 0; i < q; ++i) {
//        assert(scanf("%d %d %d", &l[i], &r[i], &v[i]) == 3);
//    }
//
//    std::vector<int> ans = distribute_candies(c, l, r, v);
//
//    for(int i = 0; i < n; ++i) {
//        if (i > 0) {
//            printf(" ");
//        }
//        printf("%d", ans[i]);
//    }
//    printf("\n");
//    fclose(stdout);
//    return 0;
//}

Compilation message

candies.cpp: In function 'std::vector<int> distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
   24 | }
      | ^

Subtask #1
3.0 / 3.0

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

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5083 ms 7268 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1697 ms 8032 KB Output is correct
3 Correct 717 ms 6016 KB Output is correct
4 Execution timed out 5053 ms 13272 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1985 ms 7652 KB Output is correct
4 Correct 1208 ms 4004 KB Output is correct
5 Execution timed out 5042 ms 10828 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 12 ms 340 KB Output is correct
6 Execution timed out 5083 ms 7268 KB Time limit exceeded
7 Halted 0 ms 0 KB -