제출 #1279401

#제출 시각아이디문제언어결과실행 시간메모리
1279401hssaan_arifInspections (NOI23_inspections)C++20
29 / 100
2099 ms144132 KiB
// #include <me> #include <bits/stdc++.h> using namespace std; #define endl "\n" #define pb push_back #define int long long const int N = 3e5 + 5, M = 1e9 + 7, LG = 20; int n , m , q , l , r; void solve(){ cin >> n >> m >> q; map<int,int> mp; int cr = 0 , tot = 0; vector<int> e; for (int i = 1 ; i <= m ; i++){ cin >> l >> r; for (l ; l <= r ; l++){ cr++; if (mp[l] == 0){ mp[l] = cr; }else{ tot++; e.pb(cr - mp[l] + 1); mp[l] = cr; } } } sort(e.begin() , e.end()); for (int i = 1 ; i <= q ; i++){ cin >> l; cout << tot - ((upper_bound(e.begin() , e.end() , l+1) - e.begin())) << ' '; } cout << endl; } signed main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int ts = 1; // cin >> ts; while(ts--){ solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...