제출 #788726

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
788726		prefixorsuuffiixx	Examination (JOI19_examination)	C++17	100 / 100	2232 ms	1780 KiB

examination

#include <iostream>
#pragma GCC target ("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast,unroll-loops")
using namespace std;
long long ans;
int x,y,z;
int n,m;
int a[100000],b[100000];
int main() {
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    scanf("%d %d" , &n , &m);
    for (int i = 0;i<n;i++)scanf("%d %d" , &a[i] , &b[i]);
    while(m--){
        ans = 0;
        scanf("%d %d %d" , &x , &y , &z);
        for (int i = 0; i < n; i++)ans += (a[i] >= x & b[i] >= y & a[i]+b[i]>=z);
        cout << ans << '\n';
    }
}

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

examination.cpp: In function 'int main()':
examination.cpp:17:49: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   17 |         for (int i = 0; i < n; i++)ans += (a[i] >= x & b[i] >= y & a[i]+b[i]>=z);
      |                                            ~~~~~^~~~
examination.cpp:17:77: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   17 |         for (int i = 0; i < n; i++)ans += (a[i] >= x & b[i] >= y & a[i]+b[i]>=z);
      |                                                                    ~~~~~~~~~^~~
examination.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     scanf("%d %d" , &n , &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
examination.cpp:13:33: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     for (int i = 0;i<n;i++)scanf("%d %d" , &a[i] , &b[i]);
      |                            ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |         scanf("%d %d %d" , &x , &y , &z);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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