oj.uz

Submission #338943

# Submission time Handle Problem Language Result Execution time Memory
338943 2020-12-24T10:16:51 Z jenkinsser Red-blue table (IZhO19_stones) C++17
10 / 100
 78 ms 1388 KB 
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define st first
#define nd second
#define pii pair<int,int>
#define N 200005
#define INF 1000000005
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) (x).begin(),(x).end()
#define ll long long
#define int ll
using namespace std;

int n,m,ans;
int cnt[N];

void solve(){
    cin >> n >> m;
    char table[n+1][m+1];
    int ans;
    if(n>=m){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                table[i][j]='+';
            }
        }
        ans=n;
        int cur=1;
        int l=n*(m-1)/(n+2);
        for(int i=1;i<=n;i++){
            for(int j=1;j<=(m-1)/2;j++){
                table[i][cur]='-';
                cnt[cur]++;
                cur++;
                if(cur-1==l) cur=1;
            }
        }
        for(int i=1;i<=l;i++){
            if(cnt[i]>=n/2+1){
                ans++;
                cnt[i]=0;
            }
        }
    }
    else{
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                table[i][j]='-';
            }
        }
        ans=m;
        int cur=1;
        int l=m*(n-1)/(m+2);
        for(int i=1;i<=m;i++){
            for(int j=1;j<=(n-1)/2;j++){
                table[cur][i]='+';
                cnt[cur]++;
                cur++;
                if(cur-1==l) cur=1;
            }
        }
        for(int i=1;i<=l;i++){
            if(cnt[i]>=m/2+1){
                ans++;
                cnt[i]=0;
            }
        }
    }
    cout << ans << endl;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cout << table[i][j];
        }
        cout << endl;
    }
}

int32_t main(){
    fastio()
    int t=1;
    cin >> t;
    while(t--)
        solve();
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong answer in test 4 4: 4 < 5

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 364 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong answer in test 4 4: 4 < 5

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 78 ms 1388 KB Wrong answer in test 77 87: 161 < 162
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 58 ms 1388 KB Wrong answer in test 24 24: 36 < 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong answer in test 4 4: 4 < 5