QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#345002 | #8221. 多方计算 | Crysfly | 0 | 112ms | 55892kb | C++17 | 1.0kb | 2024-03-05 23:06:05 | 2024-03-05 23:06:05 |
Judging History
answer
// what is matter? never mind.
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2")
#include "mpc.h"
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
#define maxn 400005
#define inf 0x3f3f3f3f
int n,m,up;
int precalc(int nn,int mm){
n=nn,m=mm;
up=n+m+3;
return up;
}
bool transmit(player&F,int round,int pos){
int lst=F.last_message;
int d=round-pos-1;
int x=(d%up+up)%up;
if(lst){
int t=F.memory[x]+lst;
while(1){
F.memory[x]=t&1,t>>=1;
if(!t)break;
++x,t+=F.memory[x];
}
}
if(pos==n)return 0;
int res=F.memory[x];
F.memory[x]=0;
return res;
}
详细
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 10
Accepted
time: 1ms
memory: 5996kb
input:
5 5 3185997250635081508 10243950506680270049
output:
4123764187658
result:
ok Perfect. 10
Test #2:
score: 0
Wrong Answer
time: 1ms
memory: 5916kb
input:
5 5 3552483843587513799 14478819593833617714
output:
4123764187648
result:
points 0.0 Correct Answer. 0
Subtask #2:
score: 0
Wrong Answer
Test #37:
score: 10
Accepted
time: 13ms
memory: 32592kb
input:
1000 1 17833636513278974999 18032835279213373306
output:
4123764187658
result:
ok Perfect. 10
Test #38:
score: 10
Accepted
time: 12ms
memory: 32172kb
input:
1000 1 14730911653810224758 12266600726496100996
output:
4123764187658
result:
ok Perfect. 10
Test #39:
score: 10
Accepted
time: 17ms
memory: 30240kb
input:
1000 1 8799733959292548924 5387063902427699037
output:
4123764187658
result:
ok Perfect. 10
Test #40:
score: 0
Wrong Answer
time: 16ms
memory: 31448kb
input:
1000 1 9630334707439747607 4291049102998855878
output:
4123764187648
result:
points 0.0 Correct Answer. 0
Subtask #3:
score: 0
Wrong Answer
Test #73:
score: 0
Wrong Answer
time: 16ms
memory: 30900kb
input:
1000 10 7581650225429700886 16046788410942473709
output:
4123764187648
result:
points 0.0 Correct Answer. 0
Subtask #4:
score: 0
Wrong Answer
Test #109:
score: 0
Wrong Answer
time: 17ms
memory: 32556kb
input:
1000 30 15510757929061591914 2629686482095382587
output:
4123764187648
result:
points 0.0 Correct Answer. 0
Subtask #5:
score: 0
Wrong Answer
Test #145:
score: 0
Wrong Answer
time: 1ms
memory: 5972kb
input:
3 1000 341353812123787886 3685575517089631424
output:
4123764187648
result:
points 0.0 Correct Answer. 0
Subtask #6:
score: 0
Wrong Answer
Test #181:
score: 0
Wrong Answer
time: 0ms
memory: 8100kb
input:
10 1000 18326939717248212778 15447461170187547045
output:
4123764187648
result:
points 0.0 Correct Answer. 0
Subtask #7:
score: 0
Wrong Answer
Test #217:
score: 0
Wrong Answer
time: 9ms
memory: 19416kb
input:
500 1000 3911210051670624968 2787181900148297327
output:
4123764187648
result:
points 0.0 Correct Answer. 0
Subtask #8:
score: 0
Wrong Answer
Test #253:
score: 0
Wrong Answer
time: 28ms
memory: 32588kb
input:
1000 1000 2442055921391744378 15448328346037637846
output:
4123764187648
result:
points 0.0 Correct Answer. 0
Subtask #9:
score: 0
Wrong Answer
Test #289:
score: 0
Wrong Answer
time: 68ms
memory: 42420kb
input:
1500 1500 8660688640427922501 1436138393991664715
output:
4123764187648
result:
points 0.0 Correct Answer. 0
Subtask #10:
score: 0
Wrong Answer
Test #325:
score: 0
Wrong Answer
time: 112ms
memory: 55892kb
input:
2000 2000 6596342253746377097 6195418207254921855
output:
4123764187648
result:
points 0.0 Correct Answer. 0