QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#276769#7517. Flying Ship Storyship2077WA 89ms3804kbC++14845b2023-12-06 10:27:172023-12-06 10:27:17

Judging History

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

  • [2023-12-06 10:27:17]
  • 评测
  • 测评结果:WA
  • 用时:89ms
  • 内存:3804kb
  • [2023-12-06 10:27:17]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
struct node{int x,y,v;};
vector<node>vec;
int x,y,op,T,lastans;
int read(){
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)) {if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x*f;
}
void insert(int x,int y,int v){
	for (int i=0;i<vec.size();i++)
		if (vec[i].x==x&&vec[i].y==y) return ;
		else if (vec[i].v<v)
			return vec.insert(vec.begin()+i,{x,y,v}),void();
	vec.push_back({x,y,v});
	if (vec.size()>4) vec.pop_back();
}
int query(int x,int y){
	for (int i=0;i<vec.size();i++)
		if (vec[i].x^x&&vec[i].y^y)
			return vec[i].v;
	return 0;
}
int main(){
	T=read();while (T--){
		op=read();x=read()^lastans;y=read()^lastans;
		if (op==1) insert(x,y,read()^lastans);
		else printf("%d\n",lastans=query(x,y));
	}
	return 0;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3804kb

input:

5
1 2 3 1
1 4 5 2
2 2 2
2 3 7
2 3 4

output:

2
1
0

result:

ok 3 lines

Test #2:

score: -100
Wrong Answer
time: 89ms
memory: 3796kb

input:

1000000
2 370943499 431961772
1 1 1 11995570
2 37566858 838793045
1 11995571 11995569 908148975
2 11995571 11995571
1 1 3 716821068
2 67877937 3
1 11995571 11995571 771898489
2 38381714 99749723
1 915818844 915818847 729541681
2 592361351 915818846
1 783627722 783627722 639375021
2 102203700 8636489...

output:

0
11995570
0
11995570
915818845
502113644
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
1005695937
10056...

result:

wrong answer 6th lines differ - expected: '783627723', found: '502113644'