제출 #832475

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
832475	2023-08-21 10:45:13	Liudas	Fruits (NOI22_fruits)	C++17	0 / 100	343 ms	29100 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <vector>
#include <iostream>
#include <set>
using namespace std;
int main(){
    int N;
    cin >> N;
    vector<int> arr(N), brr(N);
    set<int> used;
    for(int i = 0; i < N; i ++){
        cin >> arr[i];
        used.insert(arr[i]);
    }
    for(int i = 0; i < N; i ++){
        cin >> brr[i];
    }
    int maxi = -1;
    set<int> left;
    for(int i = 1; i <= N; i ++){
        if(used.find(i) == used.end())
        left.insert(i);
    }
    vector<int> C(N);
    for(int i = 0; i < N; i ++){
        maxi = max(arr[i], maxi);
        if(arr[i] != -1)continue;
        if(left.lower_bound(maxi+1)!=left.end()){
            arr[i] = *left.lower_bound(maxi+1);
            left.erase(left.lower_bound(maxi+1));
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 6
• Subtask 2: 0 / 5
• Subtask 3: 0 / 11
• Subtask 4: 0 / 13
• Subtask 5: 0 / 23
• Subtask 6: 0 / 42