| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1334194 | a.pendov | Examination (JOI19_examination) | C++20 | 1 ms | 516 KiB |
#include <bits/stdc++.h>
using namespace std;
long long S[5000],T[5000];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long N,Q,X,Y,Z;
cin>>N>>Q;
for(int i=0;i<N;i++)
{
cin>>S[i]>>T[i];
}
for(int i=0;i<N;i++)
{
int ans=0;
cin>>X>>Y>>Z;
if(X+Y>=Z)
{
for(int j=0;j<N;j++)
{
ans+=(S[i]>=X&&T[i]>=Y);
}
cout<<ans<<'\n';
}
else
{
for(int j=0;j<N;j++)
{
ans+=(S[i]+T[i]>=Z);
ans-=(S[i]+T[i]>=Z&&T[i]<Y);
ans-=(S[i]+T[i]>=Z&&S[i]<X);
}
cout<<ans<<'\n';
}
}
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
