oj.uz

답안 #342560

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
342560 2021-01-02T11:24:29 Z Olerinskiy Red-blue table (IZhO19_stones) C++14
100 / 100
 43 ms 2412 KB 
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert> 
#include <vector>
#include <ostream>
#include <istream>
#include <stack>
#include <deque>
#include <queue>
#include <functional>
#include <chrono>
#include <stack>

using namespace std;

#define int long long
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define ld long double

istream& operator>> (istream& in, pii& b) {
    in >> b.first >> b.second;
    return in;
}

ostream& operator<< (ostream& out, const pii& b) {
    out << "{" << b.first << ", " << b.second << "}";
    return out;
}

template<typename T> ostream& operator<< (ostream& out, const vector<T>& a) {
    for (auto k : a) out << k << " ";
    return out;
}

template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}

#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << (x) << endl;
    const long long INF = 1e18;
    const long long mod = 2600000069;
    const long long p = 10;
#else
    #define dbg(x) 57
    const long long INF = 1e18;
    const long long mod = 2600000069;  
    const long long p = 179;
#endif

const ld PI = 4 * atan(1);

#define time clock() / (double) CLOCKS_PER_SEC

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,sse3,sse4")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("fast-math")
// #pragma GCC target("avx2")  
// #pragma GCC optimize("section-anchors")
// #pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
// #pragma GCC optimize("vpt")
// #pragma GCC optimize("rename-registers")
// #pragma GCC optimize("move-loop-invariants")
// #pragma GCC optimize("unswitch-loops")
// #pragma GCC optimize("function-sections")
// #pragma GCC optimize("data-sections")

mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());

const int N = 1010;

char a[N][N];

int solve(int n, int m) {
    int x = ((m - m / 2 - 1) * n) / (n / 2 + 1);
    int ans = n + x;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            a[i][j] = '+';
        }
    }
    int ptr = 0;
    for (int i = 0; i < x; i++) {
        for (int j = 0; j < n / 2 + 1; j++) {
            a[ptr][i] = '-';
            ptr++;
            if (ptr == n) ptr = 0;
        }
    }
    return ans;
}

void solve() {
    int n, m;
    cin >> n >> m;
    int ans;
    int sw = 0;
    if (n >= m) {
        cout << solve(n, m) << "\n";
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                cout << a[i][j];
            }
            cout << "\n";
        }
    } else {
        cout << solve(m, n) << "\n";
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (a[j][i] == '+') cout << '-';
                else cout << '+';
            }
            cout << "\n";
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int q = 1;
    cin >> q;
    while (q--) {
        solve();
    }
}
/*

*/

Compilation message

stones.cpp: In function 'void solve()':
stones.cpp:108:9: warning: unused variable 'ans' [-Wunused-variable]
  108 |     int ans;
      |         ^~~
stones.cpp:109:9: warning: unused variable 'sw' [-Wunused-variable]
  109 |     int sw = 0;
      |         ^~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 1516 KB Output is correct
2 Correct 31 ms 2156 KB Output is correct
3 Correct 34 ms 2156 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 1516 KB Output is correct
2 Correct 28 ms 1900 KB Output is correct
3 Correct 25 ms 1644 KB Output is correct

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 43 ms 1516 KB Output is correct
6 Correct 31 ms 2156 KB Output is correct
7 Correct 34 ms 2156 KB Output is correct
8 Correct 35 ms 1516 KB Output is correct
9 Correct 28 ms 1900 KB Output is correct
10 Correct 25 ms 1644 KB Output is correct
11 Correct 9 ms 620 KB Output is correct
12 Correct 26 ms 1900 KB Output is correct
13 Correct 31 ms 2028 KB Output is correct
14 Correct 22 ms 1772 KB Output is correct
15 Correct 35 ms 2412 KB Output is correct
16 Correct 26 ms 2028 KB Output is correct
17 Correct 12 ms 1388 KB Output is correct