QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #808509 | #9874. Matrix Construction | WhiteBread | TL | 722ms | 3820kb | C++14 | 639b | 2024-12-10 21:10:44 | 2024-12-10 21:10:51 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int t;int a[1004][1004];
void solve()
{
int p,q,cnt=1;cin>>p>>q;
for(int j=1;j<=100*q+1;j++)
{
int w=j;
for(int i=1;w>0;i++,w--)
{
if(i<=p&&w<=q&&i>0&&w>0)
a[i][w]=cnt++;
}
}
cout<<"YES\n";
for(int i=1;i<=p;i++,cout<<'\n')
{
for(int j=1;j<=q;j++)
{
cout<<a[i][j]<<' ';
}
}
}
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>t;
while(t--)
{
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3708kb
input:
2 1 1 2 3
output:
YES 1 YES 1 2 4 3 5 6
result:
ok All test cases passed. (2 test cases)
Test #2:
score: 0
Accepted
time: 142ms
memory: 3704kb
input:
361 4 9 11 12 16 14 3 7 17 13 1 19 12 3 15 19 11 3 8 18 13 10 8 13 9 18 14 11 7 13 6 16 12 13 1 6 11 15 18 19 5 6 17 19 2 3 17 11 16 19 6 14 5 9 7 2 5 11 15 16 3 15 7 11 16 2 19 15 5 19 2 17 13 12 3 5 19 14 6 3 18 2 16 4 6 8 10 9 17 4 5 16 17 9 16 11 6 9 16 5 3 19 18 9 13 9 12 19 6 13 17 15 13 7 12 ...
output:
YES 1 2 4 7 11 15 19 23 27 3 5 8 12 16 20 24 28 31 6 9 13 17 21 25 29 32 34 10 14 18 22 26 30 33 35 36 YES 1 2 4 7 11 16 22 29 37 46 56 67 3 5 8 12 17 23 30 38 47 57 68 78 6 9 13 18 24 31 39 48 58 69 79 88 10 14 19 25 32 40 49 59 70 80 89 97 15 20 26 33 41 50 60 71 81 90 98 105 21 27 34 42 ...
result:
ok All test cases passed. (361 test cases)
Test #3:
score: 0
Accepted
time: 273ms
memory: 3676kb
input:
264 23 1 25 8 21 15 23 21 9 20 23 9 7 22 19 24 8 23 12 21 10 23 23 7 21 19 9 25 9 21 25 21 25 18 16 24 22 24 16 23 1 21 22 6 14 24 11 22 15 25 17 20 25 16 23 3 16 21 21 21 3 20 20 21 7 20 3 23 3 21 21 5 22 19 9 23 20 23 6 22 24 10 22 8 20 2 12 20 20 25 24 22 23 15 22 13 25 22 24 3 13 20 3 24 15 23 2...
output:
YES 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 YES 1 2 4 7 11 16 22 29 3 5 8 12 17 23 30 37 6 9 13 18 24 31 38 45 10 14 19 25 32 39 46 53 15 20 26 33 40 47 54 61 21 27 34 41 48 55 62 69 28 35 42 49 56 63 70 77 36 43 50 57 64 71 78 85 44 51 58 65 72 79 ...
result:
ok All test cases passed. (264 test cases)
Test #4:
score: 0
Accepted
time: 722ms
memory: 3820kb
input:
113 31 57 57 1 57 25 29 57 57 54 36 57 26 57 2 57 57 48 14 57 57 6 57 53 38 57 15 57 57 43 3 57 57 38 18 57 23 57 57 35 57 56 1 57 57 3 57 50 20 57 9 57 57 34 42 57 16 57 57 4 56 57 57 7 57 20 57 11 34 57 53 57 7 57 49 57 19 57 32 57 57 19 57 42 57 8 57 10 5 57 21 57 37 57 57 40 22 57 57 2 13 57 33 ...
output:
YES 1 2 4 7 11 16 22 29 37 46 56 67 79 92 106 121 137 154 172 191 211 232 254 277 301 326 352 379 407 436 466 497 528 559 590 621 652 683 714 745 776 807 838 869 900 931 962 993 1024 1055 1086 1117 1148 1179 1210 1241 1272 3 5 8 12 17 23 30 38 47 57 68 80 93 107 122 138 155 173 192 212 233 255 278 ...
result:
ok All test cases passed. (113 test cases)
Test #5:
score: -100
Time Limit Exceeded
input:
127 15 64 64 2 33 64 64 31 64 11 64 41 64 49 7 64 64 48 64 18 64 53 64 26 61 64 10 64 64 24 20 64 37 64 64 34 64 32 64 4 64 46 64 47 64 42 11 64 64 6 48 64 64 12 64 7 64 45 64 50 6 64 64 22 64 1 64 61 19 64 64 17 60 64 22 64 64 9 64 62 64 57 26 64 64 33 54 64 28 64 2 64 32 64 29 64 35 64 36 64 64 51...
output:
YES 1 2 4 7 11 16 22 29 37 46 56 67 79 92 106 121 136 151 166 181 196 211 226 241 256 271 286 301 316 331 346 361 376 391 406 421 436 451 466 481 496 511 526 541 556 571 586 601 616 631 646 661 676 691 706 721 736 751 766 781 796 811 826 841 3 5 8 12 17 23 30 38 47 57 68 80 93 107 122 137 152 167 1...