QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#528342 | #7178. Bishops | JoeyJ | WA | 67ms | 5304kb | C++14 | 834b | 2024-08-23 13:01:31 | 2024-08-23 13:01:32 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int flag=0;
if(n>m) swap(n,m),flag=0;
vector<pair<int,int>> res;
if(n==m){
for(int i=1;i<=n;i++) res.push_back({i,1});
for(int i=2;i<n;i++) res.push_back({i,n});
}else{
for(int i=1;i<=n;i++) res.push_back({i,1}),res.push_back({i,m});
if(n%2){
int k=n+1>>1;
for(int i=1+k;i<=m-k;i++) res.push_back({k,i});
}else{
int k=(n>>1)+1;
for(int i=1+k;i<=m-k;i+=2) res.push_back({k-1,i}),res.push_back({k,i});
}
}
cout<<res.size()<<endl;
for(pair<int,int> p:res){
if(!flag) cout<<p.first<<' '<<p.second<<endl;
else cout<<p.second<<' '<<p.first<<endl;
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
input:
2 5
output:
6 1 1 1 5 2 1 2 5 1 3 2 3
result:
ok n: 2, m: 5, bishops: 6
Test #2:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
5 5
output:
8 1 1 2 1 3 1 4 1 5 1 2 5 3 5 4 5
result:
ok n: 5, m: 5, bishops: 8
Test #3:
score: 0
Accepted
time: 67ms
memory: 5304kb
input:
100000 100000
output:
199998 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 61...
result:
ok n: 100000, m: 100000, bishops: 199998
Test #4:
score: -100
Wrong Answer
time: 63ms
memory: 5228kb
input:
100000 99999
output:
199998 1 1 1 100000 2 1 2 100000 3 1 3 100000 4 1 4 100000 5 1 5 100000 6 1 6 100000 7 1 7 100000 8 1 8 100000 9 1 9 100000 10 1 10 100000 11 1 11 100000 12 1 12 100000 13 1 13 100000 14 1 14 100000 15 1 15 100000 16 1 16 100000 17 1 17 100000 18 1 18 100000 19 1 19 100000 20 1 20 100000 21 1 21 100...
result:
wrong answer Integer parameter [name=y] equals to 100000, violates the range [1, 99999]