QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#82410#5361. 土豆评测机Qingyu100 ✓2ms3428kbC++206.1kb2023-02-27 20:13:062023-02-27 20:17:42

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-02-27 20:17:42]
  • 评测
  • 测评结果:100
  • 用时:2ms
  • 内存:3428kb
  • [2023-02-27 20:13:06]
  • 提交

answer

#include<stdio.h>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>
#include<assert.h>
#include<set>
#include<cmath>
#include<queue>
#include<cstdlib>
#include<iostream>
#include<bitset>
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define rep(i,j,k) for(int i=(int)(j);i<=(int)(k);i++)
#define per(i,j,k) for(int i=(int)(j);i>=(int)(k);i--)
using namespace std;
typedef long long LL;
typedef double db;
void output(){
puts("assign i n");
puts("label loop");
puts("read");
puts("calc p x * 2166909333");
puts("calc p p + 2832601672");
puts("calc p p & 4095");
puts("calc p p * 985761");
puts("calc p p + 2333");
puts("calc q x * 564950499");
puts("calc q q + 3132427306");
puts("calc t q & 65536");
puts("cjump skip0");
puts("calc a[0] a[0] ^ x");
puts("calc a[15] a[15] ^ p");
puts("label skip0");
puts("calc q x * 940422545");
puts("calc q q + 1457850878");
puts("calc t q & 65536");
puts("cjump skip1");
puts("calc a[1] a[1] ^ x");
puts("calc a[16] a[16] ^ p");
puts("label skip1");
puts("calc q x * 4014475419");
puts("calc q q + 1115438165");
puts("calc t q & 65536");
puts("cjump skip2");
puts("calc a[2] a[2] ^ x");
puts("calc a[17] a[17] ^ p");
puts("label skip2");
puts("calc q x * 148486085");
puts("calc q q + 3285006151");
puts("calc t q & 65536");
puts("cjump skip3");
puts("calc a[3] a[3] ^ x");
puts("calc a[18] a[18] ^ p");
puts("label skip3");
puts("calc q x * 33063459");
puts("calc q q + 143542612");
puts("calc t q & 65536");
puts("cjump skip4");
puts("calc a[4] a[4] ^ x");
puts("calc a[19] a[19] ^ p");
puts("label skip4");
puts("calc q x * 2949666339");
puts("calc q q + 4145580805");
puts("calc t q & 65536");
puts("cjump skip5");
puts("calc a[5] a[5] ^ x");
puts("calc a[20] a[20] ^ p");
puts("label skip5");
puts("calc q x * 2263141867");
puts("calc q q + 3551763926");
puts("calc t q & 65536");
puts("cjump skip6");
puts("calc a[6] a[6] ^ x");
puts("calc a[21] a[21] ^ p");
puts("label skip6");
puts("calc q x * 3011590671");
puts("calc q q + 3784291474");
puts("calc t q & 65536");
puts("cjump skip7");
puts("calc a[7] a[7] ^ x");
puts("calc a[22] a[22] ^ p");
puts("label skip7");
puts("calc q x * 203858535");
puts("calc q q + 704877633");
puts("calc t q & 65536");
puts("cjump skip8");
puts("calc a[8] a[8] ^ x");
puts("calc a[23] a[23] ^ p");
puts("label skip8");
puts("calc q x * 3248758299");
puts("calc q q + 2932042469");
puts("calc t q & 65536");
puts("cjump skip9");
puts("calc a[9] a[9] ^ x");
puts("calc a[24] a[24] ^ p");
puts("label skip9");
puts("calc q x * 4220021345");
puts("calc q q + 3765302984");
puts("calc t q & 65536");
puts("cjump skip10");
puts("calc a[10] a[10] ^ x");
puts("calc a[25] a[25] ^ p");
puts("label skip10");
puts("calc q x * 312183491");
puts("calc q q + 1899894091");
puts("calc t q & 65536");
puts("cjump skip11");
puts("calc a[11] a[11] ^ x");
puts("calc a[26] a[26] ^ p");
puts("label skip11");
puts("calc q x * 1874372715");
puts("calc q q + 3173404801");
puts("calc t q & 65536");
puts("cjump skip12");
puts("calc a[12] a[12] ^ x");
puts("calc a[27] a[27] ^ p");
puts("label skip12");
puts("calc q x * 1180715889");
puts("calc q q + 357571490");
puts("calc t q & 65536");
puts("cjump skip13");
puts("calc a[13] a[13] ^ x");
puts("calc a[28] a[28] ^ p");
puts("label skip13");
puts("calc q x * 3855404393");
puts("calc q q + 130060903");
puts("calc t q & 65536");
puts("cjump skip14");
puts("calc a[14] a[14] ^ x");
puts("calc a[29] a[29] ^ p");
puts("label skip14");
puts("calc i i - 1");
puts("calc t i > 0");
puts("cjump loop");
puts("assign i 0");
puts("label loop2");
puts("assign p 0");
puts("assign q 0");
puts("calc t i & 1");
puts("cjump skip20");
puts("calc p p ^ a[0]");
puts("calc q q ^ a[15]");
puts("label skip20");
puts("calc t i & 2");
puts("cjump skip21");
puts("calc p p ^ a[1]");
puts("calc q q ^ a[16]");
puts("label skip21");
puts("calc t i & 4");
puts("cjump skip22");
puts("calc p p ^ a[2]");
puts("calc q q ^ a[17]");
puts("label skip22");
puts("calc t i & 8");
puts("cjump skip23");
puts("calc p p ^ a[3]");
puts("calc q q ^ a[18]");
puts("label skip23");
puts("calc t i & 16");
puts("cjump skip24");
puts("calc p p ^ a[4]");
puts("calc q q ^ a[19]");
puts("label skip24");
puts("calc t i & 32");
puts("cjump skip25");
puts("calc p p ^ a[5]");
puts("calc q q ^ a[20]");
puts("label skip25");
puts("calc t i & 64");
puts("cjump skip26");
puts("calc p p ^ a[6]");
puts("calc q q ^ a[21]");
puts("label skip26");
puts("calc t i & 128");
puts("cjump skip27");
puts("calc p p ^ a[7]");
puts("calc q q ^ a[22]");
puts("label skip27");
puts("calc t i & 256");
puts("cjump skip28");
puts("calc p p ^ a[8]");
puts("calc q q ^ a[23]");
puts("label skip28");
puts("calc t i & 512");
puts("cjump skip29");
puts("calc p p ^ a[9]");
puts("calc q q ^ a[24]");
puts("label skip29");
puts("calc t i & 1024");
puts("cjump skip210");
puts("calc p p ^ a[10]");
puts("calc q q ^ a[25]");
puts("label skip210");
puts("calc t i & 2048");
puts("cjump skip211");
puts("calc p p ^ a[11]");
puts("calc q q ^ a[26]");
puts("label skip211");
puts("calc t i & 4096");
puts("cjump skip212");
puts("calc p p ^ a[12]");
puts("calc q q ^ a[27]");
puts("label skip212");
puts("calc t i & 8192");
puts("cjump skip213");
puts("calc p p ^ a[13]");
puts("calc q q ^ a[28]");
puts("label skip213");
puts("calc t i & 16384");
puts("cjump skip214");
puts("calc p p ^ a[14]");
puts("calc q q ^ a[29]");
puts("label skip214");
puts("calc q q % 985761");
puts("calc t q != 2333");
puts("cjump failed");
puts("assign j 0");
puts("label loopin");
puts("calc t j >= k");
puts("cjump succeed");
puts("calc t p == result[j]");
puts("cjump failed");
puts("calc j j + 1");
puts("jump loopin");
puts("label succeed");
puts("assign result[k] p");
puts("calc k k + 1");
puts("calc t k == m");
puts("cjump gotoend");
puts("label failed");
puts("calc i i + 1");
puts("calc t i < 65536");
puts("cjump loop2");
puts("label gotoend");
puts("end");
}
int main(){
	output();
	return 0;
}

詳細信息

Test #1:

score: 5
Accepted
time: 0ms
memory: 3428kb

input:

1

output:

assign i n
label loop
read
calc p x * 2166909333
calc p p + 2832601672
calc p p & 4095
calc p p * 985761
calc p p + 2333
calc q x * 564950499
calc q q + 3132427306
calc t q & 65536
cjump skip0
calc a[0] a[0] ^ x
calc a[15] a[15] ^ p
label skip0
calc q x * 940422545
calc q q + 1457850878
calc t q & 6...

result:

ok AC

Test #2:

score: 10
Accepted
time: 2ms
memory: 3316kb

input:

2

output:

assign i n
label loop
read
calc p x * 2166909333
calc p p + 2832601672
calc p p & 4095
calc p p * 985761
calc p p + 2333
calc q x * 564950499
calc q q + 3132427306
calc t q & 65536
cjump skip0
calc a[0] a[0] ^ x
calc a[15] a[15] ^ p
label skip0
calc q x * 940422545
calc q q + 1457850878
calc t q & 6...

result:

ok AC

Test #3:

score: 5
Accepted
time: 1ms
memory: 3376kb

input:

3

output:

assign i n
label loop
read
calc p x * 2166909333
calc p p + 2832601672
calc p p & 4095
calc p p * 985761
calc p p + 2333
calc q x * 564950499
calc q q + 3132427306
calc t q & 65536
cjump skip0
calc a[0] a[0] ^ x
calc a[15] a[15] ^ p
label skip0
calc q x * 940422545
calc q q + 1457850878
calc t q & 6...

result:

ok AC

Test #4:

score: 5
Accepted
time: 2ms
memory: 3332kb

input:

4

output:

assign i n
label loop
read
calc p x * 2166909333
calc p p + 2832601672
calc p p & 4095
calc p p * 985761
calc p p + 2333
calc q x * 564950499
calc q q + 3132427306
calc t q & 65536
cjump skip0
calc a[0] a[0] ^ x
calc a[15] a[15] ^ p
label skip0
calc q x * 940422545
calc q q + 1457850878
calc t q & 6...

result:

ok AC

Test #5:

score: 15
Accepted
time: 2ms
memory: 3376kb

input:

5

output:

assign i n
label loop
read
calc p x * 2166909333
calc p p + 2832601672
calc p p & 4095
calc p p * 985761
calc p p + 2333
calc q x * 564950499
calc q q + 3132427306
calc t q & 65536
cjump skip0
calc a[0] a[0] ^ x
calc a[15] a[15] ^ p
label skip0
calc q x * 940422545
calc q q + 1457850878
calc t q & 6...

result:

ok AC

Test #6:

score: 10
Accepted
time: 0ms
memory: 3332kb

input:

6

output:

assign i n
label loop
read
calc p x * 2166909333
calc p p + 2832601672
calc p p & 4095
calc p p * 985761
calc p p + 2333
calc q x * 564950499
calc q q + 3132427306
calc t q & 65536
cjump skip0
calc a[0] a[0] ^ x
calc a[15] a[15] ^ p
label skip0
calc q x * 940422545
calc q q + 1457850878
calc t q & 6...

result:

ok AC

Test #7:

score: 10
Accepted
time: 2ms
memory: 3344kb

input:

7

output:

assign i n
label loop
read
calc p x * 2166909333
calc p p + 2832601672
calc p p & 4095
calc p p * 985761
calc p p + 2333
calc q x * 564950499
calc q q + 3132427306
calc t q & 65536
cjump skip0
calc a[0] a[0] ^ x
calc a[15] a[15] ^ p
label skip0
calc q x * 940422545
calc q q + 1457850878
calc t q & 6...

result:

ok AC

Test #8:

score: 40
Accepted
time: 2ms
memory: 3316kb

input:

8

output:

assign i n
label loop
read
calc p x * 2166909333
calc p p + 2832601672
calc p p & 4095
calc p p * 985761
calc p p + 2333
calc q x * 564950499
calc q q + 3132427306
calc t q & 65536
cjump skip0
calc a[0] a[0] ^ x
calc a[15] a[15] ^ p
label skip0
calc q x * 940422545
calc q q + 1457850878
calc t q & 6...

result:

points 1.0 max #(cell used) = 30