oj.uz

Submission #150966

# Submission time Handle Problem Language Result Execution time Memory
150966 2019-09-01T13:14:10 Z leatherman Red-blue table (IZhO19_stones) C++14
0 / 100
 102 ms 1856 KB 
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#define ll int
#define ld long double
#define endl "\n"
#define fi first
#define se second
#define y1 sadjfskldf
#define PB push_back
#define sqr(x) ((x) * (x))
#define all(x) x.begin(), x.end()
using namespace std;
using namespace __gnu_pbds;
mt19937_64 rnd(chrono::system_clock::now().time_since_epoch().count());

const ll N = 1005;

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll Q,n,m,ans,kol,edd,a[N][N];
set<pair<ll, ll> > s;
set<pair<ll, ll> > :: iterator it;
vector<pair<ll, ll> > v;
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>Q;
    while(Q--)
    {
        cin>>n>>m;
        s.clear();
        if(n > m)
        {
            for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) a[i][j] = 0;
            for(int i = 1; i <= n; i++) s.insert({m, i});
            ans = n;
            for(int i = 1; i <= m; i++)
            {
                edd = 0;
                kol = n / 2 + 1;
                v.clear();
                for(it = --s.end(); it != s.begin(); --it)
                {
                    if((*it).fi == m / 2 + 1)
                    {
                        edd = 1;
                        break;
                    }
                    v.PB(*it);
                    if(--kol == 0) break;
                }
                if(edd) break;
                for(auto j : v)
                {
                    s.erase(s.find({j.fi, j.se}));
                    s.insert({j.fi - 1, j.se});
                    a[j.se][i] = 1;
                }
                ans++;
            }
        } else
        {
            for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) a[i][j] = 0;
            for(int j = 1; j <= m; j++) s.insert({n, j});
            ans = m;
            for(int i = 1; i <= n; i++)
            {
                edd = 0;
                kol = m / 2 + 1;
                v.clear();
                for(it = --s.end(); it != s.begin(); --it)
                {
                    if((*it).fi == n / 2 + 1)
                    {
                        edd = 1;
                        break;
                    }
                    v.PB(*it);
                    if(--kol == 0) break;
                }
                if(edd) break;
                for(auto j : v)
                {
                    s.erase(s.find({j.fi, j.se}));
                    s.insert({j.fi - 1, j.se});
                    a[i][j.se] = 1;
                }
                ans++;
            }
         }
         cout<<ans<<endl;
         for(int i = 1; i <= n; i++)
         {
             for(int j = 1; j <= m; j++) cout<<(a[i][j] ? '+' : '-');
             cout<<endl;
         }
    }

    return 0;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB in the table A+B is not equal to 2

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 504 KB in the table A+B is not equal to 2

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB in the table A+B is not equal to 2

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 101 ms 1796 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 102 ms 1856 KB in the table A+B is not equal to 2
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB in the table A+B is not equal to 2