oj.uz

Submission #956446

# Submission time Handle Problem Language Result Execution time Memory
956446 2024-04-02T00:53:08 Z Darren0724 Red-blue table (IZhO19_stones) C++17
10 / 100
 24 ms 1696 KB 
#include <bits/stdc++.h>
using namespace std;
#define LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define int long long
#define all(x) x.begin(), x.end()
#define endl '\n'
const int N=200005;
const int INF=1e18;
void solve(){
    int n,m;cin>>n>>m;
    int flag=(n>m);
    if(flag)swap(n,m);
    vector<vector<int>> v(n,vector<int>(m));
    int ans=0;
    if(n==1){
        for(int i=0;i<m;i++){
            v[0][i]=1;
        }
        ans=m;
    }
    else if(n==2){
        ans=m;
        for(int i=0;i<m;i++){
            v[0][i]=1;
            v[1][i]=1;
        }
    }
    else if(n==3){
        ans=m+1;
        for(int i=0;i<m;i++){
            v[0][i]=1;
            v[1][i]=1;
        }
    }
    else{
        int need=(m+2)/2;
        int p=(n-1)/2*m;
        ans=m+p/need;
        queue<int> q;
        for(int i=0;i<m;i++){
            q.push(i);
        }
        for(int i=0;i<p/need;i++){
            for(int j=0;j<need;j++){
                int r=q.front();
                q.pop();
                v[i][r]=1;
                q.push(r);
            }
        }
    }
    cout<<ans<<endl;
    if(!flag){
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                cout<<(v[i][j]?'-':'+');
            }
            cout<<endl;
        }
    }
    else{
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                cout<<(v[j][i]?'+':'-');
            }
            cout<<endl;
        }
    }
}
int32_t main() {
    LCBorz;
    int t;cin>>t;
    while(t--){
        solve();
    }
    
    return 0;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB in the table A+B is not equal to 5
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB in the table A+B is not equal to 5
3 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 1624 KB in the table A+B is not equal to 116
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 1696 KB in the table A+B is not equal to 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB in the table A+B is not equal to 5
3 Halted 0 ms 0 KB -