QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#526383#5438. Half MixedpotentialWA 12ms3648kbC++202.3kb2024-08-21 14:54:382024-08-21 14:54:39

Judging History

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

  • [2024-08-21 14:54:39]
  • 评测
  • 测评结果:WA
  • 用时:12ms
  • 内存:3648kb
  • [2024-08-21 14:54:38]
  • 提交

answer

# include <bits/stdc++.h>
using namespace std;
# define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
# define int long long
# define lowbit(x) (x & (-x))
# define fi first
# define se second
// # define endl '\n'

inline int Read();

typedef pair<int, int> PII;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
const int N = 1e6 + 10;

map <int, int> mp;
vector <int> v;

void Solve(){
    int n, m;
    cin >> n >> m;
    if((n * m * (n + 1) * (m + 1) / 4) % 2 != 0){
        cout << "No\n";
        return;
    }
    cout << "Yes\n";
    int sum = (n * m * (n + 1) * (m + 1) / 4) / 2;
    int f = -1;
    for(int i = 0; i <= m; i ++){
        int a = n * i * (n + 1) * (i + 1) / 4;
        int b = n * (n + 1) * 2 / 4 * (m - i);
        if(a + b > sum){
            f = -1;
            break;
        }else if(a + b == sum){
            f = i;
            break;
        }
    }
    if(f != -1){
        for(int i = 1; i <= n; i ++){
            int k = 1;
            for(int j = 1; j <= m; j ++){
                if(j <= f){
                    cout << 0 <<" \n"[j == m];
                }else{
                    cout << k <<" \n"[j == m];
                    k = 1 - k;
                }
            }
        }
        return;
    }
    for(int i = 0; i <= n; i ++){
        int a = m * i * (m + 1) * (i + 1) / 4;
        int b = m * (m + 1) * 2 / 4 * (n - i);
        if(a + b > sum){
            f = -1;
            break;
        }else if(a + b == sum){
            f = i;
            break;
        }
    }
    if(f != -1){
        int k = 1;
        for(int i = 1; i <= n; i ++){
            if(i <= f){
                for(int j = 1; j <= m; j ++){
                    cout << 0 <<" \n"[j == m];
                }
            }else{
                for(int j = 1; j <= m; j ++){
                    cout << k <<" \n"[j == m];
                }
                k = 1 - k;
            }
            
        }
    }
}
signed main(){
    IOS;
    int T = 1;
    cin >> T;
    while (T--) 
        Solve();
    return 0;
}
inline int Read(){
    int x = 0, f = 1; char c = getchar();
    while (c < '0' || c > '9'){ if (c == '-') f = -1; c = getchar();}
    while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
    return x * f;
}

详细

Test #1:

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

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: 12ms
memory: 3648kb

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

result:

wrong output format Expected integer, but "No" found (test case 22)