제출 #463393

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
463393	2021-08-11 05:37:17	amunduzbaev	Exam (eJOI20_exam)	C++14	27 / 100	711 ms	196688 KiB

exam

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 "bits/stdc++.h"
using namespace std;
//~ #define int long long
void solve1(int n, vector<int>& a, vector<int>& b){
  vector<int> dp(n);
  if(n <= 5005){
    vector<array<int, 3>> tmp;
    for(int i=0;i<n;i++){
      tmp.push_back({a[i], 0, i});
      tmp.push_back({b[i], 1, i});
    }
    
    sort(tmp.begin(), tmp.end());
    for(int last=0, i=0;i<(int)tmp.size();){
      int j = i;
      while(j < (int)tmp.size() && tmp[j][0] == tmp[i][0]) j++;
      while(i < j){
        if(tmp[i][1]){
          b[tmp[i][2]] = last;
        } else {
          a[tmp[i][2]] = last;
        } i++; 
      } last++;
    }
    
    //~ for(int i=0;i<n;i++) cout<<a[i]<<" ";
    //~ cout<<endl;
    //~ for(int i=0;i<n;i++) cout<<b[i]<<" ";
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 14 / 14
• Subtask 2: 0 / 12
• Subtask 3: 13 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 16
• Subtask 6: 0 / 22