제출 #131554

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
131554		bkinik	Examination (JOI19_examination)	C++14	2 / 100	3013 ms	4796 KiB

examination

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

#define mp make_pair
#define pb push_back
#define pob pop_back
#define st first
#define nd second

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;

ll n,m,k,l,q;


void test() {
	cout<<"test"<<endl;
}

int main() {
	cin>>n>>q;
	vector<pll> students;
	vector<pair<pll,ll> > queries;

	students.resize(n);
	queries.resize(q);

	for(int i=0; i<n; i++) {
		cin>>students[i].st>>students[i].nd;
	}
	for(int i=0; i<q; i++) {
		cin>>queries[i].st.st>>queries[i].st.nd>>queries[i].nd;
	}
	for(int i=0; i<q; i++) {
		ll s = 0;
		for(int j=0; j<n; j++) {
			if(students[j].st >= queries[i].st.st and (students[j].nd >= queries[i].st.nd) and students[j].st + students[j].nd >= queries[i].nd) s++;
		}
		cout<<s<<endl;
	}
	return 0;
}

• Subtask 1: 2 / 2
• Subtask 2: 0 / 20
• Subtask 3: 0 / 21
• Subtask 4: 0 / 57