제출 #942236

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
942236	2024-03-10 11:27:03	Litusiano	Pilot (NOI19_pilot)	C++17	89 / 100	1076 ms	79084 KiB

pilot

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
#define endl "\n"
const int MAXN = 1e6+5;
 
long long calc(pair<int,int> p){
  int len = p.second - p.first +1;
  return 1LL*(1LL*len*(1LL*len+1))/2;
}
 
signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n,m; cin>>n>>m;
  vector<int> v(n); for(int& i : v) cin>>i;
  vector<int> b(m); for(int& i : b) cin>>i;
  set<pair<int,int>> segs; segs.insert({0,n-1}); segs.insert({n,n});
  vector<vector<int>> ST(MAXN);
  for(int i = 0; i<m; i++) ST[b[i]].push_back(i); // indexed one more
  for(int i = 0; i<n; i++) ST[v[i]].push_back(-i-1);
  long long ans = 1LL*n*(n+1)/2;
  vector<long long> q(m);
  // cerr<<MAXN<<endl;
  for(int j = MAXN-1; j>=0; j--){
    for(int i : ST[j]){
      if(i < 0){
        // cur seg
        if(segs.size() == 0) continue;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 3 / 3
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 5 / 5
• Subtask 6: 9 / 9
• Subtask 7: 14 / 14
• Subtask 8: 10 / 10
• Subtask 9: 11 / 11
• Subtask 10: 0 / 11