Submission #8595457


Source Code Expand

#include<iostream>
#include<map>
#include<string.h>
#include<queue>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<cstdlib>
#include<math.h>
#include<set>
#include<array>
using namespace std;

template<class T>inline bool chmax(T&a, T b) { if (a < b) { a = b; return 1; }return 0; }
template<class T>inline bool chmin(T&a, T b) { if (a > b) { a = b; return 1; }return 0; }



#define rep(n) for(int i=0;i<(n);i++)
typedef pair<int, int> pii;

typedef long long ll;
typedef pair<ll, ll>pll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
const int MOD = 1000000007;
const int INF = 1 << 29;
const long long LINF = 1LL << 60;


int main() {


	int n, x, y, z;
	cin >> n >> x >> y >> z;
	vi a(n), b(n);
	rep(n)cin >> a[i] >> b[i];
	int cnt = 0;
	rep(n) {
		if (a[i] >= x && b[i] >= y && a[i] + b[i] >= z)cnt++;

	}
	cout << cnt << endl;
	return 0;
}

Submission Info

Submission Time
Task B - 採用面接
User ranchan
Language C++14 (GCC 5.4.1)
Score 100
Code Size 975 Byte
Status AC
Exec Time 1 ms
Memory 256 KiB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 30 / 30 30 / 30 40 / 40
Status
AC × 3
AC × 6
AC × 6
AC × 20
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sub1_in01.txt, sub1_in02.txt, sub1_in03.txt, sub1_in04.txt, sub1_in05.txt
Subtask2 sample_01.txt, sub2_in01.txt, sub2_in02.txt, sub2_in03.txt, sub2_in04.txt, sub2_in05.txt
Subtask3 sample_01.txt, sample_02.txt, sample_03.txt, sub1_in01.txt, sub1_in02.txt, sub1_in03.txt, sub1_in04.txt, sub1_in05.txt, sub2_in01.txt, sub2_in02.txt, sub2_in03.txt, sub2_in04.txt, sub2_in05.txt, sub3_in01.txt, sub3_in02.txt, sub3_in03.txt, sub3_in04.txt, sub3_in05.txt, sub3_in06.txt, sub3_in07.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KiB
sample_02.txt AC 1 ms 256 KiB
sample_03.txt AC 1 ms 256 KiB
sub1_in01.txt AC 1 ms 256 KiB
sub1_in02.txt AC 1 ms 256 KiB
sub1_in03.txt AC 1 ms 256 KiB
sub1_in04.txt AC 1 ms 256 KiB
sub1_in05.txt AC 1 ms 256 KiB
sub2_in01.txt AC 1 ms 256 KiB
sub2_in02.txt AC 1 ms 256 KiB
sub2_in03.txt AC 1 ms 256 KiB
sub2_in04.txt AC 1 ms 256 KiB
sub2_in05.txt AC 1 ms 256 KiB
sub3_in01.txt AC 1 ms 256 KiB
sub3_in02.txt AC 1 ms 256 KiB
sub3_in03.txt AC 1 ms 256 KiB
sub3_in04.txt AC 1 ms 256 KiB
sub3_in05.txt AC 1 ms 256 KiB
sub3_in06.txt AC 1 ms 256 KiB
sub3_in07.txt AC 1 ms 256 KiB