QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#724102 | #9175. Geometry Hacking | Kangliyang | AC ✓ | 0ms | 3880kb | C++14 | 995b | 2024-11-08 09:33:05 | 2024-11-08 09:33:05 |
Judging History
answer
#include <bits/stdc++.h>
#define in(x) freopen(#x".in","r",stdin)
#define out(x) freopen(#x".out","w",stdout)
#define make(x) freopen(#x".in","w",stdout)
#define ll long long
#define int long long
#ifdef MY_COMPUTER
#define debug(...) fprintf(stderr,##__VA_ARGS__)
#else
#define debug(...) void(0)
#endif
#define vector basic_string
#define pii array<int,2>
using namespace std;
inline int read()
{
int s=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-')
f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
s=s*10+ch-'0';
ch=getchar();
}
return s*f;
}
template<typename _it>
void read(_it a,_it b){
while(a!=b) (*a)=read(),a++;
}
template<typename _it>
void write(const char* form,_it a,_it b,int op=0){
while(a!=b) printf(form,*a),a++;
if(op) puts("");
}
int n;
signed main(){
n=read();
for(int i=1;i<=n;i++){
puts("4");
puts("-2 1");
puts("1 0");
printf("2 %lld\n",i);
puts("1 -1");
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3880kb
input:
2
output:
4 -2 1 1 0 2 1 1 -1 4 -2 1 1 0 2 2 1 -1
result:
ok Everything ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3736kb
input:
1
output:
4 -2 1 1 0 2 1 1 -1
result:
ok Everything ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3752kb
input:
1000
output:
4 -2 1 1 0 2 1 1 -1 4 -2 1 1 0 2 2 1 -1 4 -2 1 1 0 2 3 1 -1 4 -2 1 1 0 2 4 1 -1 4 -2 1 1 0 2 5 1 -1 4 -2 1 1 0 2 6 1 -1 4 -2 1 1 0 2 7 1 -1 4 -2 1 1 0 2 8 1 -1 4 -2 1 1 0 2 9 1 -1 4 -2 1 1 0 2 10 1 -1 4 -2 1 1 0 2 11 1 -1 4 -2 1 1 0 2 12 1 -1 4 -2 1 1 0 2 13 1 -1 4 -2 1 1 0 2 14 1 -1 4 -2 1 1 0 2 15...
result:
ok Everything ok
Test #4:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
500
output:
4 -2 1 1 0 2 1 1 -1 4 -2 1 1 0 2 2 1 -1 4 -2 1 1 0 2 3 1 -1 4 -2 1 1 0 2 4 1 -1 4 -2 1 1 0 2 5 1 -1 4 -2 1 1 0 2 6 1 -1 4 -2 1 1 0 2 7 1 -1 4 -2 1 1 0 2 8 1 -1 4 -2 1 1 0 2 9 1 -1 4 -2 1 1 0 2 10 1 -1 4 -2 1 1 0 2 11 1 -1 4 -2 1 1 0 2 12 1 -1 4 -2 1 1 0 2 13 1 -1 4 -2 1 1 0 2 14 1 -1 4 -2 1 1 0 2 15...
result:
ok Everything ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3796kb
input:
399
output:
4 -2 1 1 0 2 1 1 -1 4 -2 1 1 0 2 2 1 -1 4 -2 1 1 0 2 3 1 -1 4 -2 1 1 0 2 4 1 -1 4 -2 1 1 0 2 5 1 -1 4 -2 1 1 0 2 6 1 -1 4 -2 1 1 0 2 7 1 -1 4 -2 1 1 0 2 8 1 -1 4 -2 1 1 0 2 9 1 -1 4 -2 1 1 0 2 10 1 -1 4 -2 1 1 0 2 11 1 -1 4 -2 1 1 0 2 12 1 -1 4 -2 1 1 0 2 13 1 -1 4 -2 1 1 0 2 14 1 -1 4 -2 1 1 0 2 15...
result:
ok Everything ok
Test #6:
score: 0
Accepted
time: 0ms
memory: 3792kb
input:
420
output:
4 -2 1 1 0 2 1 1 -1 4 -2 1 1 0 2 2 1 -1 4 -2 1 1 0 2 3 1 -1 4 -2 1 1 0 2 4 1 -1 4 -2 1 1 0 2 5 1 -1 4 -2 1 1 0 2 6 1 -1 4 -2 1 1 0 2 7 1 -1 4 -2 1 1 0 2 8 1 -1 4 -2 1 1 0 2 9 1 -1 4 -2 1 1 0 2 10 1 -1 4 -2 1 1 0 2 11 1 -1 4 -2 1 1 0 2 12 1 -1 4 -2 1 1 0 2 13 1 -1 4 -2 1 1 0 2 14 1 -1 4 -2 1 1 0 2 15...
result:
ok Everything ok
Test #7:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
69
output:
4 -2 1 1 0 2 1 1 -1 4 -2 1 1 0 2 2 1 -1 4 -2 1 1 0 2 3 1 -1 4 -2 1 1 0 2 4 1 -1 4 -2 1 1 0 2 5 1 -1 4 -2 1 1 0 2 6 1 -1 4 -2 1 1 0 2 7 1 -1 4 -2 1 1 0 2 8 1 -1 4 -2 1 1 0 2 9 1 -1 4 -2 1 1 0 2 10 1 -1 4 -2 1 1 0 2 11 1 -1 4 -2 1 1 0 2 12 1 -1 4 -2 1 1 0 2 13 1 -1 4 -2 1 1 0 2 14 1 -1 4 -2 1 1 0 2 15...
result:
ok Everything ok
Extra Test:
score: 0
Extra Test Passed