oj.uz

Submission #345546

# Submission time Handle Problem Language Result Execution time Memory
345546 2021-01-07T14:45:12 Z Kerim Examination (JOI19_examination) C++17
2 / 100
 3000 ms 1668 KB 
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int a[MAXN],b[MAXN],c[MAXN],id[MAXN];
int x[MAXN],y[MAXN],z[MAXN],di[MAXN];
int n,q;
int main(){
    //freopen("file.in", "r", stdin);
    scanf("%d%d",&n,&q);
    for(int i=1;i<=n;i++){
    	scanf("%d%d",a+i,b+i);
    	c[i]=a[i]+b[i];
    }
    for(int i=1;i<=q;i++){
    	scanf("%d%d%d",x+i,y+i,z+i),di[i]=i;
    	int yuf=0;
    	for(int j=1;j<=n;j++)
    		yuf+=(a[j]>=x[i] && b[j]>=y[i] && c[j]>=z[i]);
    	printf("%d\n",yuf);
    }
    return 0;
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |     scanf("%d%d",&n,&q);
      |     ~~~~~^~~~~~~~~~~~~~
examination.cpp:27:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   27 |      scanf("%d%d",a+i,b+i);
      |      ~~~~~^~~~~~~~~~~~~~~~
examination.cpp:31:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   31 |      scanf("%d%d%d",x+i,y+i,z+i),di[i]=i;
      |      ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 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 52 ms 480 KB Output is correct
8 Correct 48 ms 508 KB Output is correct
9 Correct 50 ms 504 KB Output is correct
10 Correct 50 ms 492 KB Output is correct
11 Correct 52 ms 620 KB Output is correct
12 Correct 49 ms 492 KB Output is correct
13 Correct 49 ms 620 KB Output is correct
14 Correct 57 ms 620 KB Output is correct
15 Correct 51 ms 708 KB Output is correct
16 Correct 24 ms 620 KB Output is correct
17 Correct 34 ms 560 KB Output is correct
18 Correct 12 ms 492 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3037 ms 1668 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3037 ms 1668 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 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 52 ms 480 KB Output is correct
8 Correct 48 ms 508 KB Output is correct
9 Correct 50 ms 504 KB Output is correct
10 Correct 50 ms 492 KB Output is correct
11 Correct 52 ms 620 KB Output is correct
12 Correct 49 ms 492 KB Output is correct
13 Correct 49 ms 620 KB Output is correct
14 Correct 57 ms 620 KB Output is correct
15 Correct 51 ms 708 KB Output is correct
16 Correct 24 ms 620 KB Output is correct
17 Correct 34 ms 560 KB Output is correct
18 Correct 12 ms 492 KB Output is correct
19 Execution timed out 3037 ms 1668 KB Time limit exceeded
20 Halted 0 ms 0 KB -