oj.uz

답안 #493028

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
493028 2021-12-10T03:17:52 Z khangal Red-blue table (IZhO19_stones) C++14
0 / 100
 51 ms 1244 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<long long> vl;
typedef pair<long long, long long > pl;
const int N = 1e6 + 1;
#define po pop_back
#define pb push_back
#define mk make_pair
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define boost ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18 
#define MIN -1e18
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n, m, ans, mid, mn, mx, cnt, sum, h1, h2, arr[3234567],arr1[1234567], sz, k, i, j, h, a, w, x, y, z,par[1234567];
bool used[1234567];
//ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
//vector<ll> edge[1234567];
//ll jump[22][223456];
//ll lvl[1234567];
//ll bit[1234567];
//ll timer;
//ll st[1234567],endd[1234567];
//pl tr[1234567];
//ll dp[5005][5005];
ll power(ll base, ll val, ll mod) {
    ll res = 1;
    while (val) {
        if (val % 2 == 1) {
            res = res * base;
        }
        base = base * base;
        base %= mod;
        res %= mod;
        val /= 2;
    }
    return res;
}
bool comp(pl x,pl y){
    if(x.ff>y.ff)return true;
    return false;
}
ll find(ll x){
    if(x==par[x])return x;
    else return par[x]=find(par[x]);
}
class A {
public:
    static void funcA() {
        cin>>n>>m;
        ans=0;
        cnt=0;
        ll idx,idy;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                cnt=0;
                if(i*2>n)cnt+=j;
                if(j*2<m)cnt+=i;
                cnt+=(n-i);
                if(cnt>ans){
                    ans=cnt;
                    idx=i;
                    idy=j;
                }
            }
        }
        char grid[n+1][m+1];
        cout<<ans<<'\n';
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(i<=idx && j<=idy)grid[i][j]='-';
                else grid[i][j]='+';
            }
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                cout<<grid[i][j];
            }
            cout<<'\n';
        }
    }
}lol;
void solve() {
    A::funcA();
}
int main() {
    ll T = 1;
    cin>>T;
    boost;
    while (T--) {
        solve();
    }
}

Compilation message

stones.cpp: In static member function 'static void A::funcA()':
stones.cpp:85:17: warning: 'idx' may be used uninitialized in this function [-Wmaybe-uninitialized]
   85 |                 if(i<=idx && j<=idy)grid[i][j]='-';
      |                 ^~
stones.cpp:85:27: warning: 'idy' may be used uninitialized in this function [-Wmaybe-uninitialized]
   85 |                 if(i<=idx && j<=idy)grid[i][j]='-';
      |                    ~~~~~~~^~~~~~~~~

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 0 ms 256 KB Wrong answer in test 2 1: 1 < 2

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 300 KB Wrong answer in test 2 1: 1 < 2

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 0 ms 256 KB Wrong answer in test 2 1: 1 < 2

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 46 ms 1200 KB Wrong answer in test 97 21: 107 < 116
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 51 ms 1244 KB Wrong answer in test 24 24: 35 < 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 0 ms 256 KB Wrong answer in test 2 1: 1 < 2