| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1332483 | goribb | Heat Stroke (JOI24_heat) | C++20 | 1 ms | 344 KiB |
#include<bits/stdc++.h>
using namespace std;
void solve(){
int n; cin >> n; vector<int> c(n+1);
for(int i = 1; i <= n; ++i) cin >> c[i];
int l; cin >> l; vector<int> x(l);
for(int &i : x) cin >> i;
sort(x.begin(), x.end()); vector<int> k(n+1, 0);
vector<bool> ok(l, 0);
for(int i = 0; i < l; ++i){
if(c[x[i]+1] != 0){
k[x[i]+1] = 1; ok[i] = 1; c[x[i]+1]--;
}
}
for(int i = 0; i < l; ++i){
if(c[x[i]] != 0 and !ok[i]){
ok[i] = 1;
}
}
int ans = 0;
for(int i = 1; i < l; ++i){
if(ok[i] == 0) ans++;
}
cout << ans;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
//freopen("milkorder.in", "r", stdin);
//freopen("milkorder.out", "w", stdout);
int t; t = 1;
while(t--) solve();
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
