| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1335428 | SmuggingSpun | Inspections (NOI23_inspections) | C++20 | 6 ms | 440 KiB |
#include<bits/stdc++.h>
#define taskname "B"
using namespace std;
typedef long long ll;
int n, m, q;
namespace sub1{
void solve(){
vector<int>l(m + 1), r(m + 1);
for(int i = 1; i <= m; i++){
cin >> l[i] >> r[i];
}
for(int _ = 0; _ < q; _++){
ll s;
int ans = 0;
cin >> s;
vector<int>last(n + 1, 0);
for(int i = 1, day = 0; i <= m; i++){
for(int j = l[i]; j <= r[i]; j++){
if(last[j] != 0 && s + last[j] <= day){
ans++;
}
last[j] = ++day;
}
}
cout << ans << " ";
}
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
cin >> n >> m >> q;
if(max({n, m, q}) <= 200){
sub1::solve();
}
}Compilation message (stderr)
| # | 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... | ||||
