제출 #716071

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
716071		bane	Examination (JOI19_examination)	C++17	2 / 100	3050 ms	2208 KiB

examination

#include <bits/stdc++.h>
       
using namespace std;
       
#ifdef LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
       
#define ar array
#define ll long long
#define ld long double
#define sza(x) ((int)x.size())
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define mp make_pair
#define frs first
#define sc second
#define eb emplace_back
#define fr(i, n, m) for(int i = (n); i < (m); i ++)     
const int MAX_N = 1e5 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;
int dx[4] = {0,0,1,-1};
int dy[4] = {-1,1,0,0};
const int Block = 310;
int n,q;
vector<pair<int,int>>A;
void Examination(){
	scanf("%d%d", &n, &q);
	A.resize(n);
	fr(i, 0, n)
		scanf("%d%d", &A[i].frs, &A[i].sc);
	while(q--){
		int x,y,z;
		scanf("%d%d%d", &x, &y, &z);
		int ans = 0;
		fr(i, 0, n){
			ans+=(A[i].frs >= x) & (A[i].sc >= y) & (A[i].frs + A[i].sc >= z);
		}
		printf("%d\n", ans);
	}
}
       
int main() {
 //   ios_base::sync_with_stdio(0);
 //   cin.tie(0); cout.tie(0);
  //  freopen("art.in", "r", stdin);
  //  freopen("art.out", "w", stdout);
    Examination();
}

컴파일 시 표준 에러 (stderr) 메시지

examination.cpp: In function 'void Examination()':
examination.cpp:32:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |  scanf("%d%d", &n, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~
examination.cpp:35:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |   scanf("%d%d", &A[i].frs, &A[i].sc);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:38:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |   scanf("%d%d%d", &x, &y, &z);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

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