답안 #359305

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
359305	2021-01-26T17:30:18 Z	jhnah917	Examination (JOI19_examination)	C++14	2 / 100	3000 ms	2600 KB

examination

/******************************
Author: jhnah917(Justice_Hui)
g++ -std=c++17 -DLOCAL
******************************/

#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx,avx2,fma")

#include <bits/stdc++.h>
using namespace std;

using uint = unsigned;
using ll = long long;
using ull = unsigned long long;
constexpr int SZ = 1 << 17;

int N, Q;
alignas(256) int S[SZ], T[SZ], Sum[SZ];
alignas(256) char Flags[SZ];

int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    cin >> N >> Q;
    for(int i=1; i<=N; i++) cin >> S[i] >> T[i], Sum[i] = S[i] + T[i];
    for(int i=1; i<=Q; i++){
        int x, y, z, ans = 0; cin >> x >> y >> z;
        for(int j=1; j<=N; j++) if(S[j] >= x && T[j] >= y && Sum[j] >= z) ans++;
        cout << ans << "\n";
    }
}

Subtask #1

2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	8 ms	384 KB	Output is correct
8	Correct	7 ms	364 KB	Output is correct
9	Correct	7 ms	364 KB	Output is correct
10	Correct	6 ms	364 KB	Output is correct
11	Correct	6 ms	364 KB	Output is correct
12	Correct	6 ms	364 KB	Output is correct
13	Correct	9 ms	364 KB	Output is correct
14	Correct	6 ms	364 KB	Output is correct
15	Correct	6 ms	364 KB	Output is correct
16	Correct	6 ms	364 KB	Output is correct
17	Correct	6 ms	384 KB	Output is correct
18	Correct	6 ms	364 KB	Output is correct

Subtask #2

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	3053 ms	2600 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	3053 ms	2600 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 57.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	8 ms	384 KB	Output is correct
8	Correct	7 ms	364 KB	Output is correct
9	Correct	7 ms	364 KB	Output is correct
10	Correct	6 ms	364 KB	Output is correct
11	Correct	6 ms	364 KB	Output is correct
12	Correct	6 ms	364 KB	Output is correct
13	Correct	9 ms	364 KB	Output is correct
14	Correct	6 ms	364 KB	Output is correct
15	Correct	6 ms	364 KB	Output is correct
16	Correct	6 ms	364 KB	Output is correct
17	Correct	6 ms	384 KB	Output is correct
18	Correct	6 ms	364 KB	Output is correct
19	Execution timed out	3053 ms	2600 KB	Time limit exceeded
20	Halted	0 ms	0 KB	-