QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#643907#5438. Half MixedflsWA 171ms3640kbC++201.5kb2024-10-16 07:29:412024-10-16 07:29:42

Judging History

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

  • [2024-10-16 07:29:42]
  • 评测
  • 测评结果:WA
  • 用时:171ms
  • 内存:3640kb
  • [2024-10-16 07:29:41]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

#define qmx(a,b) a<b?b:a
#define qmn(a,b) a>b?b:a
#define ll long long
#define fr first
#define se second

const int mxn = 1e6+6;

bool sp;

ll n, m, d, s, f, len;

int line[mxn];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int test;
    cin>>test;
    while(test--){
        sp = false;
        cin >> n >> m;
        if((n * (n + 1)) / 2 % 2 && (m * (m + 1)) / 2 % 2){
            cout << "No\n";
            continue;
        }
        if((m * (m + 1)) / 2 % 2){
            sp = true;
            swap(n, m);
        }
        d = (m * (m + 1)) / 4;
        s = 0;
        f = 0;
        len = 0;
        for(int i = 1; i <= m ; i++){
            len++;
            if(s + len >= d){
                //cerr << len << " ";
                len = 1;
                f ^= 1;
            }
            s += len;
            line[i] = f;
        }
       // cerr << len;
        cout << "Yes\n";
        if(sp){
            for(int i = 1 ; i <= m ; i++){
                for(int j = 1 ; j <= n ; j++){
                    cout << line[i] << " ";
                }
                cout << endl;
            }
        }else{
            for(int i = 1 ; i <= n ; i++){
                for(int j = 1 ; j <= m ; j++){
                    cout << line[j] << " ";
                }
                cout << endl;
            }
        }
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
2 3
1 1

output:

Yes
0 1 0 
0 1 0 
No

result:

ok OK, Accepted. (2 test cases)

Test #2:

score: -100
Wrong Answer
time: 171ms
memory: 3604kb

input:

5382
1 1
1 2
2 1
1 3
2 2
3 1
1 4
2 3
3 2
4 1
1 5
2 4
3 3
4 2
5 1
1 6
2 5
3 4
4 3
5 2
6 1
1 7
2 6
3 5
4 4
5 3
6 2
7 1
1 8
2 7
3 6
4 5
5 4
6 3
7 2
8 1
1 9
2 8
3 7
4 6
5 5
6 4
7 3
8 2
9 1
1 10
2 9
3 8
4 7
5 6
6 5
7 4
8 3
9 2
10 1
1 11
2 10
3 9
4 8
5 7
6 6
7 5
8 4
9 3
10 2
11 1
1 12
2 11
3 10
4 9
5 8
6 ...

output:

No
No
No
Yes
0 1 0 
No
Yes
0 
1 
0 
Yes
0 0 1 0 
Yes
0 1 0 
0 1 0 
Yes
0 0 
1 1 
0 0 
Yes
0 
0 
1 
0 
No
Yes
0 0 1 0 
0 0 1 0 
Yes
0 1 0 
0 1 0 
0 1 0 
Yes
0 0 
0 0 
1 1 
0 0 
No
No
No
Yes
0 0 1 0 
0 0 1 0 
0 0 1 0 
Yes
0 1 0 
0 1 0 
0 1 0 
0 1 0 
No
No
Yes
0 0 0 0 1 1 0 
No
Yes
0 0 0 0 0 
1 1 1 1 1...

result:

wrong answer 38 Mixed Submatrices Found, but 39 Expected (test case 67)