oj.uz

Submission #1002311

# Submission time Handle Problem Language Result Execution time Memory
1002311 2024-06-19T12:23:35 Z yoav_s Chess Rush (CEOI20_chessrush) C++17
0 / 100
 0 ms 456 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<ll> v;
typedef vector<v> vv;
typedef vector<vv> vvv;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef pair<ll,ll> p;
typedef vector<p> vp;
typedef vector<vp> vvp;
typedef vector<vvp> vvvp;
typedef pair<ll, p> tri;
typedef vector<tri> vtri;
typedef vector<vtri> vvtri;
typedef vector<vvtri> vvvtri;

#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()

const ll INF = 1e18;
const ll mod = 1e9 + 7;


int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    ll R, C, Q;
    cin >> R >> C >> Q;
    for (ll iter = 0; iter < Q; iter++)
    {
        char T;
        cin >> T;
        ll from, to;
        cin >> from >> to;
        if (T == 'P')
        {
            if (from == to) cout << "1 1\n";
            else cout << "0 0\n";
        }
        else if (T == 'R')
        {
            if (from == to) cout << "1 1\n";
            else cout << "2 2\n";
        }
        else if (T == 'Q')
        {
            if (from == to || (R == C && ((from == 1 && to == C) || (from == C && to == 1)))) cout << "1 1\n";
            else
            {
                ll amt = 2;
                if (R == C && (from == 1 || from == C)) amt++;
                if (R == C && (to == 1 || to == C)) amt++;
                amt += 2;
                if ((from + 1) % 2 == (to + R) % 2)
                {
                    ll t1 = (from - to + R - 1) / 2;
                    if (t1 > 0 && from - t1 > 0) amt++;
                    ll t2 = (to - from + R - 1) / 2;
                    if (t2 > 0 && from + t2 <= C) amt++;
                }
                cout << "2 " << amt << "\n";
            }
        }
        else cout << "-1 -1\n";
    }
    return 0;
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 456 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 456 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 456 KB Output isn't correct
2 Halted 0 ms 0 KB -