QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#78066#5438. Half Mixedmagicduck#WA 27ms3416kbC++141.9kb2023-02-16 16:22:202023-02-16 16:22:20

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-02-16 16:22:20]
  • 评测
  • 测评结果:WA
  • 用时:27ms
  • 内存:3416kb
  • [2023-02-16 16:22:20]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
template <typename T> inline void read(T &F) {
    int R = 1; F = 0; char CH = getchar();
    for(; !isdigit(CH); CH = getchar()) if(CH == '-') R = -1;
    for(; isdigit(CH); CH = getchar()) F = F * 10 + CH - 48;
    F *= R;
}
inline void file(string str) {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
}
vector<int> R;
void calc(int cnt, LL x) {
    if(cnt == 0) {
        assert(x == 0);
        return;
    }
    int l = 1, r = cnt, res = 0;
    while(l <= r) {
        LL mid = (l + r) >> 1;
        if(x - 1LL * mid * (mid + 1) >= (cnt - mid) * 2)
            res = mid, l = mid + 1;
        else r = mid - 1;
    }
    R.emplace_back(res); calc(cnt - 1, x - 1LL * res * (res + 1));
}
int main() {
    //file("");
    int T; read(T);
    while(T--) {
        int n, m; read(n), read(m); R.clear();
        if(n % 4 == 0 || (n + 1) % 4 == 0) {
            puts("Yes");
            calc(n, 1LL * n * (n + 1) / 2);
            int f = 0;
            for(auto i : R) {
                f ^= 1;
                for(int j = 1; j <= i; j++, puts(""))
                    for(int k = 1; k <= m; k++)
                        putchar('0' + f), putchar(' ');
            }
        }
        else if(m % 4 == 0 || (m + 1) % 4 == 0) {
            puts("Yes");
            calc(m, 1LL * m * (m + 1) / 2);
            for(int i = 1; i <= n; i++, puts("")) {
                int f = 0;
                for(auto j : R) {
                    f ^= 1;
                    for(int k = 1; k <= j; k++)
                        putchar('0' + f), putchar(' ');
                }
            }
        }
        else puts("No");
    }
    
    #ifdef _MagicDuck
        fprintf(stderr, "# Time: %.3lf s", (double)clock() / CLOCKS_PER_SEC);
    #endif
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3372kb

input:

2
2 3
1 1

output:

Yes
1 0 1 
1 0 1 
No

result:

ok OK, Accepted. (2 test cases)

Test #2:

score: -100
Wrong Answer
time: 27ms
memory: 3416kb

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
1 0 1 
No
Yes
1 
0 
1 
Yes
1 1 1 0 
Yes
1 0 1 
1 0 1 
Yes
1 1 
0 0 
1 1 
Yes
1 
1 
1 
0 
No
Yes
1 1 1 0 
1 1 1 0 
Yes
1 1 1 
0 0 0 
1 1 1 
Yes
1 1 
1 1 
1 1 
0 0 
No
No
No
Yes
1 1 1 1 
0 0 0 0 
1 1 1 1 
Yes
1 1 1 
1 1 1 
1 1 1 
0 0 0 
No
No
Yes
1 1 1 1 0 1 0 1 
No
Yes
1 1 1 1 1 
0 0 0 0...

result:

wrong answer 3 Mixed Submatrices Found, but 5 Expected (test case 7)