답안 #919692

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
919692	2024-02-01T12:56:13 Z	vjudge1	Inspections (NOI23_inspections)	C++17	11 / 100	2000 ms	21256 KB

Main

/******************************************************************************

                              Online C++ Compiler.
               Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.

*******************************************************************************/

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n,m,q;
    cin>>n>>m>>q;
    long long int last[n+1];
    for(int i = 1;i<=n;i++)last[i]=-1;
    vector<long long int> dist[n+1];
    long long int d = 0;
    for(int i =0;i<m;i++){
        int l,r;
        cin>>l>>r;
        for(int i =l;i<=r;i++){
            if(last[i]!=-1)dist[i].push_back(d-last[i]-1);
            last[i]=d;
            d++;
        }
    }
    for(int i =1;i<=n;i++)sort(dist[i].begin(),dist[i].end());
    while(q--){
        int cnt = 0;
        long long int s;
        cin>>s;
        for(int i = 1;i<=n;i++){
            cnt+=(dist[i].end()-lower_bound(dist[i].begin(),dist[i].end(),s));
        }
        cout<<cnt<<" ";
    }
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	2 ms	600 KB	Output is correct
5	Correct	1 ms	600 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	1 ms	600 KB	Output is correct
9	Correct	2 ms	600 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct

Subtask #2

0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	2 ms	600 KB	Output is correct
5	Correct	1 ms	600 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	1 ms	600 KB	Output is correct
9	Correct	2 ms	600 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Execution timed out	2028 ms	14544 KB	Time limit exceeded
14	Halted	0 ms	0 KB	-

Subtask #3

0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	2 ms	604 KB	Output is correct
3	Execution timed out	2060 ms	21256 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #4

0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	2 ms	600 KB	Output is correct
5	Correct	1 ms	600 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	1 ms	600 KB	Output is correct
9	Correct	2 ms	600 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Execution timed out	2028 ms	14544 KB	Time limit exceeded
14	Halted	0 ms	0 KB	-

Subtask #5

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	2 ms	600 KB	Output is correct
5	Correct	1 ms	600 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	2 ms	600 KB	Output is correct
8	Correct	1 ms	600 KB	Output is correct
9	Correct	2 ms	600 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Execution timed out	2028 ms	14544 KB	Time limit exceeded
14	Halted	0 ms	0 KB	-