oj.uz

Submission #345563

# Submission time Handle Problem Language Result Execution time Memory
345563 2021-01-07T14:57:37 Z Kerim Examination (JOI19_examination) C++17
2 / 100
 3000 ms 12380 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];
vector<int>v;
int en[MAXN],bel[MAXN],cur,sz,n,q;
bool cmp(int xx,int yy){
	return (a[xx]>a[yy]);	
}
bool cmp1(int xx,int yy){
	return (x[xx]>x[yy]);	
}
int who(int x){
	return (lower_bound(all(v),x)-v.begin())+1;
}
void init(){
	int BLOK=sqrt(n);cur=1;
	for(int i=1;i<=n;i++){
		bel[i]=cur;
		if(i%BLOK==0){
			if(i==n)
				en[cur]=i;
			else
				en[cur++]=i;
		}
	}en[cur]=n;
}
vector<int>adj[MAXN];
int arr[MAXN],ans[MAXN];
void upd(int p,int v){
	arr[p]=v;
	adj[bel[p]].pb(v);
	sort(all(adj[bel[p]]));
}
int get(int p,int v){
	if(p<1 or p>n)return 0;
	int ans=0;
	for(int i=p;i<=en[bel[p]];i++)
		ans+=(arr[i]>=v);
	for(int i=bel[p]+1;i<=cur;i++)
		if(!adj[i].empty())
			tr(it,adj[i])
				ans+=(*it>=v);
			//ans+=int(adj[i].size())-int(lower_bound(all(adj[i]),v)-adj[i].begin());
	return ans;
}
int can[MAXN];
int main(){
	memset(arr,-1,sizeof arr);
   // freopen("file.in", "r", stdin);
    scanf("%d%d",&n,&q);
    vector<PII>g;
    for(int i=1;i<=n;i++){
    	scanf("%d%d",a+i,b+i);
    	c[i]=a[i]+b[i];
    	id[i]=i;
		v.pb(b[i]);
		g.pb(mp(b[i],i));
    }
    sort(all(v));sort(all(g));
    for(int i=0;i<n;i++)
    	can[g[i].ss]=i+1;
    init();
    sort(id+1,id+n+1,cmp);
    for(int i=1;i<=q;i++)
    	scanf("%d%d%d",x+i,y+i,z+i),di[i]=i;
    sort(di+1,di+q+1,cmp1);
    int p=1;
    for(int i=1;i<=q;i++){
    	while(p<=n and a[id[p]]>=x[di[i]])
    		upd(can[id[p]],c[id[p]]),p++;
    	ans[di[i]]=get(who(y[di[i]]),z[di[i]]);
    }
    for(int i=1;i<=q;i++)
    	printf("%d\n",ans[i]);
	return 0;
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:91:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   91 |     for(int i=1;i<=q;i++)
      |     ^~~
examination.cpp:93:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   93 |  return 0;
      |  ^~~~~~
examination.cpp:68:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   68 |     scanf("%d%d",&n,&q);
      |     ~~~~~^~~~~~~~~~~~~~
examination.cpp:71:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   71 |      scanf("%d%d",a+i,b+i);
      |      ~~~~~^~~~~~~~~~~~~~~~
examination.cpp:83:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   83 |      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 2 ms 3084 KB Output is correct
2 Correct 2 ms 3052 KB Output is correct
3 Correct 2 ms 3052 KB Output is correct
4 Correct 2 ms 3052 KB Output is correct
5 Correct 2 ms 3052 KB Output is correct
6 Correct 3 ms 3052 KB Output is correct
7 Correct 10 ms 3308 KB Output is correct
8 Correct 9 ms 3308 KB Output is correct
9 Correct 11 ms 3308 KB Output is correct
10 Correct 9 ms 3308 KB Output is correct
11 Correct 9 ms 3308 KB Output is correct
12 Correct 9 ms 3308 KB Output is correct
13 Correct 9 ms 3308 KB Output is correct
14 Correct 9 ms 3308 KB Output is correct
15 Correct 9 ms 3308 KB Output is correct
16 Correct 8 ms 3308 KB Output is correct
17 Correct 9 ms 3308 KB Output is correct
18 Correct 5 ms 3308 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2883 ms 10100 KB Output is correct
2 Correct 2824 ms 9860 KB Output is correct
3 Correct 2866 ms 12380 KB Output is correct
4 Execution timed out 3043 ms 11084 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2883 ms 10100 KB Output is correct
2 Correct 2824 ms 9860 KB Output is correct
3 Correct 2866 ms 12380 KB Output is correct
4 Execution timed out 3043 ms 11084 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3084 KB Output is correct
2 Correct 2 ms 3052 KB Output is correct
3 Correct 2 ms 3052 KB Output is correct
4 Correct 2 ms 3052 KB Output is correct
5 Correct 2 ms 3052 KB Output is correct
6 Correct 3 ms 3052 KB Output is correct
7 Correct 10 ms 3308 KB Output is correct
8 Correct 9 ms 3308 KB Output is correct
9 Correct 11 ms 3308 KB Output is correct
10 Correct 9 ms 3308 KB Output is correct
11 Correct 9 ms 3308 KB Output is correct
12 Correct 9 ms 3308 KB Output is correct
13 Correct 9 ms 3308 KB Output is correct
14 Correct 9 ms 3308 KB Output is correct
15 Correct 9 ms 3308 KB Output is correct
16 Correct 8 ms 3308 KB Output is correct
17 Correct 9 ms 3308 KB Output is correct
18 Correct 5 ms 3308 KB Output is correct
19 Correct 2883 ms 10100 KB Output is correct
20 Correct 2824 ms 9860 KB Output is correct
21 Correct 2866 ms 12380 KB Output is correct
22 Execution timed out 3043 ms 11084 KB Time limit exceeded
23 Halted 0 ms 0 KB -