QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#773901	#5141. Identical Parity	szy10010	WA	10ms	3676kb	C++23	1.2kb	2024-11-23 10:46:07	2024-11-23 10:46:08

Judging History

你现在查看的是最新测评结果

[2024-11-23 10:46:08]
评测

测评结果：WA
用时：10ms
内存：3676kb

查看

[2024-11-23 10:46:07]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define sf(x) scanf("%lld",&x)
#define sff(x,y) scanf("%lld%lld",&x,&y)
#define endl '\n'
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define pf(x) printf("%lld",x)
#define pii pair<int,int> 
#define f first 
#define s second
#define int long long



//
//
//


void solve()
{
    int m,n;
    cin>>m>>n;

    int now = m/n;
    int yu=m%n;
    if(n%2)
    {
        int y=n/2;
        int x;
        if(m%2)x =now-1;
        else x=now;
            //now-1
            if((yu-x)%2)
            {
                cout<<"No"<<endl;
                return;
            }
            if((yu-x)/2+x>y) 
            {
                cout<<"No"<<endl;
                return;
            }
    }
    else 
    {
        if(m%2) {
            if(yu%2==0)
            {
                cout<<"No"<<endl;
                return;
            }
        }
        else 
        if(yu%2)
        {
            cout<<"No"<<endl;
            return;
        }
    }
    cout<<"Yes"<<endl;
}
signed main()
{
    IOS;
    int _=1;
    cin>>_;
    while(_--)
        solve();
    return 0;
}

源文件, 语言: C++23

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3604kb

input:

output:

No
Yes
Yes

result:

ok 3 token(s): yes count is 2, no count is 1

Test #2:

score: -100

Wrong Answer

time: 10ms

memory: 3676kb

input:

output:

Yes
No
Yes
No
Yes
Yes
No
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
...

result:

wrong answer expected NO, found YES [18th token]