oj.uz

답안 #715432

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
715432 2023-03-26T17:10:05 Z AtabayRajabli Examination (JOI19_examination) C++11
2 / 100
 3000 ms 2012 KB 
#include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
#define MAX 1000000001
#define MOD 1000000007
#define INF 0x3F3F3F3F3F3F3F3F
#define OPT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main()
{
    OPT
    int n, q;
    cin >> n >> q;
    ll math[n+1], info[n+1];
    for(int i = 1; i<=n; i++)
        cin >> math[i] >> info[i];

    while(q--)
    {
        int a, b, c, k = 0;
        cin >> a >> b >> c;

        for(int i = 1; i<=n; i++)
        {
            if(math[i]>=a && info[i]>=b && math[i]+info[i]>=c)k++;
        }

        cout << k << endl;
    }

}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 50 ms 352 KB Output is correct
8 Correct 43 ms 352 KB Output is correct
9 Correct 44 ms 340 KB Output is correct
10 Correct 48 ms 372 KB Output is correct
11 Correct 45 ms 356 KB Output is correct
12 Correct 49 ms 372 KB Output is correct
13 Correct 53 ms 340 KB Output is correct
14 Correct 46 ms 364 KB Output is correct
15 Correct 46 ms 340 KB Output is correct
16 Correct 22 ms 368 KB Output is correct
17 Correct 34 ms 340 KB Output is correct
18 Correct 11 ms 340 KB Output is correct

Subtask #2
0 / 20.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 50 ms 352 KB Output is correct
8 Correct 43 ms 352 KB Output is correct
9 Correct 44 ms 340 KB Output is correct
10 Correct 48 ms 372 KB Output is correct
11 Correct 45 ms 356 KB Output is correct
12 Correct 49 ms 372 KB Output is correct
13 Correct 53 ms 340 KB Output is correct
14 Correct 46 ms 364 KB Output is correct
15 Correct 46 ms 340 KB Output is correct
16 Correct 22 ms 368 KB Output is correct
17 Correct 34 ms 340 KB Output is correct
18 Correct 11 ms 340 KB Output is correct
19 Execution timed out 3059 ms 2012 KB Time limit exceeded
20 Halted 0 ms 0 KB -