QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#107698#6309. Aqresnowy2002WA 2ms3428kbC++172.0kb2023-05-22 15:39:062023-05-22 15:39:11

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-05-22 15:39:11]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3428kb
  • [2023-05-22 15:39:06]
  • 提交

answer

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#define time chrono::system_clock::now().time_since_epoch().count()
#include<ext/pb_ds/tree_policy.hpp>
#define clean(x) memset(x,0,sizeof(x))
#define fil(x,n) fill(x,x+1+n,0)
#define inf 2000000009
#define maxn 1000005
#define int long long
using namespace std;
using namespace __gnu_pbds;
mt19937_64 rnd(time);
cc_hash_table<int,int>mp;

int read() {
    int x=1,res=0;
    char c=getchar();
    while(c<'0'||c>'9') {
        if(c=='-') x=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9') {
        res=res*10+(c-'0');
        c=getchar();
    }
    return res*x;
}

int a[4][4],b[4][4];
void solve() {
    int x=read(),y=read();
    for(int i=0;i<4;i++) for(int j=0;j<4;j++) a[i][j]=1;
    for(int i=0;i<4;i++) for(int j=0;j<4;j++) b[i][j]=1;
    a[0][3]=a[3][0]=a[1][1]=a[2][2]=0;
    b[0][3]=b[1][3]=b[2][1]=0;
    if(x<4&&y<4) {
        cout<<x*y<<"\n";
        for(int i=1;i<=x;i++) {
            for(int j=1;j<=y;j++) {
                cout<<1;
            } 
            puts("");
        }
        return;
    }
    int ok=0,ans=x*y;
    if(x>y) {swap(x,y);ok=1;}
    vector f(x,vector(y,0ll));
    if(x!=3) {
        for(int i=0;i<x;i++) {
            for(int j=0;j<y;j++) {
                f[i][j]=a[i%4][j%4];
                if(!f[i][j]) ans--;
            }
        }
    }

    if(x==3) {
        for(int i=0;i<x;i++) {
            for(int j=0;j<y;j++) {
                f[i][j]=b[i%4][j%4];
                if(!f[i][j]) ans--;
            }
        }
    }
    cout<<ans<<"\n";
    if(ok) {
        for(int i=0;i<y;i++) {
            for(int j=0;j<x;j++) {
                cout<<f[j][i];
            }
            puts("");
        }
    }
    else {
        for(int i=0;i<x;i++) {
            for(int j=0;j<y;j++) {
                cout<<f[i][j];
            }
            puts("");
        }
    }
}

signed main()
{
    int t=read();
    while(t--) solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 3380kb

input:

3
2 2
3 4
3 8

output:

4
11
11
9
1110
1110
1011
18
11101110
11101110
10111011

result:

ok ok (3 test cases)

Test #2:

score: -100
Wrong Answer
time: 1ms
memory: 3428kb

input:

361
2 2
2 3
2 4
2 5
2 6
2 7
2 8
2 9
2 10
2 11
2 12
2 13
2 14
2 15
2 16
2 17
2 18
2 19
2 20
3 2
3 3
3 4
3 5
3 6
3 7
3 8
3 9
3 10
3 11
3 12
3 13
3 14
3 15
3 16
3 17
3 18
3 19
3 20
4 2
4 3
4 4
4 5
4 6
4 7
4 8
4 9
4 10
4 11
4 12
4 13
4 14
4 15
4 16
4 17
4 18
4 19
4 20
5 2
5 3
5 4
5 5
5 6
5 7
5 8
5 9
5 1...

output:

4
11
11
6
111
111
6
1110
1011
8
11101
10111
9
111011
101110
11
1110111
1011101
12
11101110
10111011
14
111011101
101110111
15
1110111011
1011101110
17
11101110111
10111011101
18
111011101110
101110111011
20
1110111011101
1011101110111
21
11101110111011
10111011101110
23
111011101110111
1011101110111...

result:

wrong answer 1s are not connected. (test case 61)