QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#741624 | #7619. Make SYSU Great Again I | Carucao# | RE | 54ms | 19024kb | C++20 | 783b | 2024-11-13 14:49:20 | 2024-11-13 14:49:21 |
Judging History
answer
#include<bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;
const int N=1e6+10;
pair<int,int> ans[N];
int n,m,k;
void work()
{
cin>>n>>k;
int l=1,o=1;
for(int i=1;i<=n;++i)
{
int j=i+1;
if(j==n+1) j=1;
ans[l]=make_pair(i,i);
ans[l+1]=make_pair(i,j);
l+=2;
}
int x=2*n+1;
for(int i=1;i<=n;++i)
{
int u=i,v=i+1;
if(v==n+1) v=1;
for(int j=1;j<=n;++j)
{
if(j==u||j==v) continue;
ans[x]=make_pair(i,j);
++x;
if(x>k) break;
}
}
for(int i=1;i<=k;++i) cout<<ans[i].first<<" "<<ans[i].second<<endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T=1;
//cin>>T;
for(;T;--T)
work();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3708kb
input:
3 6
output:
1 1 1 2 2 2 2 3 3 3 3 1
result:
ok The answer is correct.
Test #2:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
3 7
output:
1 1 1 2 2 2 2 3 3 3 3 1 1 3
result:
ok The answer is correct.
Test #3:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
2 4
output:
1 1 1 2 2 2 2 1
result:
ok The answer is correct.
Test #4:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
3 9
output:
1 1 1 2 2 2 2 3 3 3 3 1 1 3 2 1 3 2
result:
ok The answer is correct.
Test #5:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
10 20
output:
1 1 1 2 2 2 2 3 3 3 3 4 4 4 4 5 5 5 5 6 6 6 6 7 7 7 7 8 8 8 8 9 9 9 9 10 10 10 10 1
result:
ok The answer is correct.
Test #6:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
10 100
output:
1 1 1 2 2 2 2 3 3 3 3 4 4 4 4 5 5 5 5 6 6 6 6 7 7 7 7 8 8 8 8 9 9 9 9 10 10 10 10 1 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 2 1 2 4 2 5 2 6 2 7 2 8 2 9 2 10 3 1 3 2 3 5 3 6 3 7 3 8 3 9 3 10 4 1 4 2 4 3 4 6 4 7 4 8 4 9 4 10 5 1 5 2 5 3 5 4 5 7 5 8 5 9 5 10 6 1 6 2 6 3 6 4 6 5 6 8 6 9 6 10 7 1 7 2 7 3 7 4 7 ...
result:
ok The answer is correct.
Test #7:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
32 64
output:
1 1 1 2 2 2 2 3 3 3 3 4 4 4 4 5 5 5 5 6 6 6 6 7 7 7 7 8 8 8 8 9 9 9 9 10 10 10 10 11 11 11 11 12 12 12 12 13 13 13 13 14 14 14 14 15 15 15 15 16 16 16 16 17 17 17 17 18 18 18 18 19 19 19 19 20 20 20 20 21 21 21 21 22 22 22 22 23 23 23 23 24 24 24 24 25 25 25 25 26 26 26 26 27 27 27 27 28 28 28 28 29...
result:
ok The answer is correct.
Test #8:
score: 0
Accepted
time: 28ms
memory: 14976kb
input:
200000 400000
output:
1 1 1 2 2 2 2 3 3 3 3 4 4 4 4 5 5 5 5 6 6 6 6 7 7 7 7 8 8 8 8 9 9 9 9 10 10 10 10 11 11 11 11 12 12 12 12 13 13 13 13 14 14 14 14 15 15 15 15 16 16 16 16 17 17 17 17 18 18 18 18 19 19 19 19 20 20 20 20 21 21 21 21 22 22 22 22 23 23 23 23 24 24 24 24 25 25 25 25 26 26 26 26 27 27 27 27 28 28 28 28 29...
result:
ok The answer is correct.
Test #9:
score: 0
Accepted
time: 54ms
memory: 19024kb
input:
200000 745589
output:
1 1 1 2 2 2 2 3 3 3 3 4 4 4 4 5 5 5 5 6 6 6 6 7 7 7 7 8 8 8 8 9 9 9 9 10 10 10 10 11 11 11 11 12 12 12 12 13 13 13 13 14 14 14 14 15 15 15 15 16 16 16 16 17 17 17 17 18 18 18 18 19 19 19 19 20 20 20 20 21 21 21 21 22 22 22 22 23 23 23 23 24 24 24 24 25 25 25 25 26 26 26 26 27 27 27 27 28 28 28 28 29...
result:
ok The answer is correct.
Test #10:
score: -100
Runtime Error
input:
199999 978736