oj.uz

답안 #452134

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
452134 2021-08-03T21:17:33 Z Khizri Fountain (eJOI20_fountain) C++17
60 / 100
 1500 ms 349896 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
int t=1,n,m,x[mxn],y[mxn],d[mxn],k,q1[mxn],q2[mxn];
vector<int>vtt[mxn];
vector<int>vt[mxn];
map<int,pii>mp;
map<pii,int>mpp;
void dfs(int u){
	mp[u]={k,vt[k].size()};
	mpp[{k,vt[k].size()}]=u;
	if(vt[k].size()){
		vt[k].pb(vt[k][vt[k].size()-1]+y[u]);
	}
	else{
		vt[k].pb(y[u]);
	}
	for(int v:vtt[u]){
		dfs(v);
	}
}
void solve(){
	scanf("%d %d",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%d %d",&x[i],&y[i]);
	}
	for(int i=1;i<=m;i++){
		scanf("%d %d",&q1[i],&q2[i]);
	}
	priority_queue<pair<pii,int>,vector<pair<pii,int>>,greater<pair<pii,int>>>q;
	for(int i=1;i<=n;i++){
		while(q.size()){
			if(q.top().F.F<x[i]){
				d[i]++;
				vtt[q.top().S].pb(i);
				q.pop();
			}
			else{
				break;
			}
		}
		q.push({{x[i],y[i]},i});
	}
	for(int i=1;i<=n;i++){
		if(d[i]==0){
			++k;
			dfs(i);
		}
	}
	for(int i=1;i<=m;i++){
		int a,b;
		a=q1[i],b=q2[i];
		pii p=mp[a];
		int x=p.F,y=p.S;
		int sum=0;
		if(y>0){
			sum+=vt[x][y-1];
		}
		auto it=lower_bound(all(vt[x]),sum+b);
		if(it==vt[x].end()){
			printf("0\n");
		}
		else{
			int ind=(it-vt[x].begin());
			int ans=mpp[{x,ind}];
			printf("%d\n",ans);
		}
	}
}
int main(){
	//IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Compilation message

fountain.cpp: In function 'void solve()':
fountain.cpp:62:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |  scanf("%d %d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~~
fountain.cpp:64:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |   scanf("%d %d",&x[i],&y[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~
fountain.cpp:67:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |   scanf("%d %d",&q1[i],&q2[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 7 ms 9932 KB Output is correct
3 Correct 9 ms 9932 KB Output is correct
4 Correct 8 ms 10236 KB Output is correct
5 Correct 7 ms 9924 KB Output is correct
6 Correct 23 ms 13520 KB Output is correct
7 Correct 9 ms 9932 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 273 ms 36664 KB Output is correct
2 Correct 305 ms 34864 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 7 ms 9932 KB Output is correct
3 Correct 9 ms 9932 KB Output is correct
4 Correct 8 ms 10236 KB Output is correct
5 Correct 7 ms 9924 KB Output is correct
6 Correct 23 ms 13520 KB Output is correct
7 Correct 9 ms 9932 KB Output is correct
8 Correct 273 ms 36664 KB Output is correct
9 Correct 305 ms 34864 KB Output is correct
10 Correct 8 ms 10020 KB Output is correct
11 Execution timed out 1602 ms 349896 KB Time limit exceeded
12 Halted 0 ms 0 KB -