# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
803410 | 2023-08-03T04:26:11 Z | ono_de206 | 사탕 분배 (IOI21_candies) | C++17 | 68 ms | 7268 KB |
#include "candies.h" #include<bits/stdc++.h> using namespace std; #define in insert #define all(x) x.begin(),x.end() #define pb push_back #define eb emplace_back #define ff first #define ss second //#define int long long typedef long long ll; typedef vector<int> vi; typedef set<int> si; typedef multiset<int> msi; typedef pair<int, int> pii; typedef vector<pii> vpii; vi distribute_candies(vi c, vi l, vi r, vi v) { int n = c.size(), q = l.size(); vector<int> ret(n); if(n * q <= 2000 * 2000) { for(int i = 0; i < q; i++) { for(int j = l[i]; j <= r[i]; j++) { ret[j] += v[i]; ret[j] = min(c[j], max(0, ret[j])); } } return ret; } if(*max_element(all(v)) >= 0) { exit(1); for(int i = 0; i < q; i++) { ret[l[i]] += v[i]; if(r[i] + 1 < n) ret[r[i] + 1] -= v[i]; } for(int i = 1; i < n; i++) { ret[i] += ret[i - 1]; } for(int i = 0; i < n; i++) { ret[i] = min(c[i], max(0, ret[i])); } return ret; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | 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 | 1 ms | 340 KB | Output is correct |
5 | Correct | 2 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 68 ms | 7268 KB | Execution failed because the return code was nonzero |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Runtime error | 42 ms | 4964 KB | Execution failed because the return code was nonzero |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Runtime error | 48 ms | 4968 KB | Execution failed because the return code was nonzero |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | 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 | 1 ms | 340 KB | Output is correct |
5 | Correct | 2 ms | 340 KB | Output is correct |
6 | Runtime error | 68 ms | 7268 KB | Execution failed because the return code was nonzero |
7 | Halted | 0 ms | 0 KB | - |