Submission #649949

#	Time	Username	Problem	Language	Result	Execution time	Memory
649949		kakayoshi	Examination (JOI19_examination)	C++17	2 / 100	3056 ms	1776 KiB

examination

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx")
#define forw(i,a,b) for(ll i=a;i<=b;i++)
#define forb(i,a,b) for(ll i=a;i>=b;i--)
#define fi first
#define se second
#define pb push_back
#define pu push
#define all(a) a.begin(),a.end()
#define getbit(mask,i) ((mask>>(i))&1)
#define minimize(a,b) (a)=min((a),(b))
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll>  pll;
const ll maxN=1e5+5;
const ll mod=1e9+9;
const ll oo=1e18+1;
const int tx[4]={-1,1,0,0};
const int ty[4]={0,0,-1,1};
const int block=350;
int n,q;
pii a[maxN];
void solve()
{
    cin>>n>>q;
    forw(i,1,n)
        cin>>a[i].fi>>a[i].se;
    forw(i,1,q)
    {
        int x,y,z; cin>>x>>y>>z;
        int ans=0;
        forw(j,1,n)
        {
            int p1= -(a[j].fi>=x);
            int p2= -(a[j].se>=y);
            int p3= -(a[j].fi+a[j].se>=z);
            ans-= p1&p2&p3;
        }
        cout<<ans<<"\n";
    }
    return;
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    //freopen("bruh.inp","r",stdin);
    //freopen("bruh.out","w",stdout);
    int t=1; //cin>>t;
    while (t--) solve();
    return 0;
}

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