QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#116218 | #6661. 야유회 | Laurie# | 0 | 1ms | 4408kb | C++14 | 1.4kb | 2023-06-28 12:19:42 | 2024-05-31 18:21:24 |
Judging History
answer
#include "workshop.h"
#include <iostream>
#include <iomanip>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <complex>
#include <random>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define itn int
#define nit int
#define ll long long
#define ms multiset
#define F(i,a,b) for(register int i=a,i##end=b;i<=i##end;++i)
#define UF(i,a,b) for(register int i=a,i##end=b;i>=i##end;--i)
#define re register
#define ri re int
#define il inline
#define pii pair<int,int>
#define cp complex<double>
#define vi vector<int>
#define ull unsigned long long
#define mem0(x) memset(x,0,sizeof(x))
#define mem0x3f(x) memset(x,0x3f,sizeof(x))
using namespace std;
int p[100002];
mt19937 rd(342342);
void init() {
F(i,0,100000-1)p[i]=i;
shuffle(p,p+100000,rd);
}
int morning(int x,int y){
x=p[x],y=p[y];
if(x%40!=y%40)return x;
return rd()%400000000;
}
int afternoon(int x, int y, int z){
if(y%40==z%40){
mt19937 rnd(y);
return rnd()%400000000;
}
return y+4000000;
}
int evening(int x, int y, int z){
if(y%40==z%40){
mt19937 rnd(y);
return rnd()%40;
}
return y%40;
}
詳細信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 1ms = 1ms + 0ms
memory: 4408kb,3832kb
input:
2dc2b1d4-8de2-INPUT-bcd3-aa55b691fdb3 1 2 40 40 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 40 0 3 1 5 7 9 6 4 2 10 8 23 21 25 27 29 26 24 22 30 28 13 11 15 17 19 16 14 12 20 18 33 31 35 37 39 36 34 32 38
output:
dd180566-1d37-PIPE-b85d-c176ae85727d 39 2 28 28 28 28 89 88 8b 8a 8d 8c 8f 8e 81 80 83 82 85 84 87 86 99 98 9b 9a 9d 9c 9f 9e 91 90 93 92 95 94 97 96 a9 a8 ab aa ad ac af ae 00014b95 0adf8948 097e7b93 00006af0 00005698 0000de9d 00002859 0000906b 0000000d 0000f6f1 0000f795 00012edb 000154db 000027e5...
input:
dd180566-1d37-PIPE-b85d-c176ae85727d 39 2 28 28 28 28 89 88 8b 8a 8d 8c 8f 8e 81 80 83 82 85 84 87 86 99 98 9b 9a 9d 9c 9f 9e 91 90 93 92 95 94 97 96 a9 a8 ab aa ad ac af ae 00014b95 0adf8948 097e7b93 00006af0 00005698 0000de9d 00002859 0000906b 0000000d 0000f6f1 0000f795 00012edb 000154db 000027e5...
output:
64be09ab-d709-ERROR-82bc-c23f6124dd26 Wrong Answer [5]
result:
wrong answer Wrong Answer [5]
Subtask #2:
score: 0
Wrong Answer
Test #8:
score: 0
Wrong Answer
time: 1ms = 1ms + 0ms
memory: 4164kb,3808kb
input:
2dc2b1d4-8de2-INPUT-bcd3-aa55b691fdb3 2 2 40 40 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 40 0 3 1 5 7 9 6 4 2 10 8 23 21 25 27 29 26 24 22 30 28 13 11 15 17 19 16 14 12 20 18 33 31 35 37 39 36 34 32 38
output:
dd180566-1d37-PIPE-b85d-c176ae85727d 39 2 28 28 28 28 89 88 8b 8a 8d 8c 8f 8e 81 80 83 82 85 84 87 86 99 98 9b 9a 9d 9c 9f 9e 91 90 93 92 95 94 97 96 a9 a8 ab aa ad ac af ae 00014b95 0adf8948 097e7b93 00006af0 00005698 0000de9d 00002859 0000906b 0000000d 0000f6f1 0000f795 00012edb 000154db 000027e5...
input:
dd180566-1d37-PIPE-b85d-c176ae85727d 39 2 28 28 28 28 89 88 8b 8a 8d 8c 8f 8e 81 80 83 82 85 84 87 86 99 98 9b 9a 9d 9c 9f 9e 91 90 93 92 95 94 97 96 a9 a8 ab aa ad ac af ae 00014b95 0adf8948 097e7b93 00006af0 00005698 0000de9d 00002859 0000906b 0000000d 0000f6f1 0000f795 00012edb 000154db 000027e5...
output:
64be09ab-d709-ERROR-82bc-c23f6124dd26 Wrong Answer [5]
result:
wrong answer Wrong Answer [5]