QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#811162 | #9701. Cat | Loxilante# | WA | 376ms | 3700kb | C++20 | 1.1kb | 2024-12-12 15:59:27 | 2024-12-12 15:59:35 |
Judging History
answer
#include <bits/stdc++.h>
#define rep(i, l, r) for(int i = l; i < r; i++)
#define hrp(i, l, r) for(int i = l; i <= r; i++)
#define rev(i, r, l) for(int i = r; i >= l; i--)
#define int ll
using namespace std;
typedef long long ll;
template<typename tn = int> tn next(void) { tn k; cin>>k; return k; }
#ifndef LOCAL
#define D(...) 0
#define I(...) 0
#endif
const int U = 1e6;
int xorsum(int e)
{
switch(e%4)
{
case 0: return e;
case 1: return 1;
case 2: return e+1;
case 3: return 0;
}
}
signed main(void)
{
#ifdef LOCAL
// freopen("C:\\Users\\Loxil\\Desktop\\IN.txt", "r", stdin);
// freopen("C:\\Users\\Loxil\\Desktop\\OUT.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int T = next();
while(T--)
{
int l, r, s;
cin>>l>>r>>s;
int ans = -1;
hrp(i, l, l+8) hrp(j, r-8, r) if (i <= j && xorsum(j)^xorsum(i-1) <= s) ans = max(ans, j-i+1);
cout<<ans<<endl;
}
return 0;
}
/*
*/
詳細信息
Test #1:
score: 0
Wrong Answer
time: 376ms
memory: 3700kb
input:
500000 28316250877914575 822981260158260522 1779547116602436425 335408917861648772 578223540024979445 74859962623690079 252509054433933447 760713016476190629 919845426262703496 522842184971407775 585335723211047202 148049062628894322 84324828731963982 354979173822804784 1001312150450968415 269587449...
output:
794665009280345948 242814622163330673 508203962042257182 62493538239639428 270654345090840803 376174809552329777 469882136957817192 42350729279043822 64865315101301174 697234070719324701 223517937810991678 108731400892235542 120906461794646288 463966315863716824 433607439314780607 450247658658833134...
result:
wrong answer 2nd numbers differ - expected: '242814622163330674', found: '242814622163330673'