oj.uz

답안 #759682

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
759682 2023-06-16T15:00:32 Z Sam_a17 Chess Rush (CEOI20_chessrush) C++17
28 / 100
 2000 ms 31700 KB 
///
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for random generations
// mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
mt19937 myrand(373);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  } else {
    // freopen("skis.in", "r", stdin);
    // freopen("skis.out", "w", stdout);
  }
}
// Indexed Set  
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const long long mod = 1e9 + 7;
long long r, c, q;
long long qq[105][105], d[105][105];

long long add(long long a, long long b) {
  return (a + b) % mod;
}

long long mult(long long a, long long b) {
  return (a * b) % mod;
}

long long sub(long long a, long long b) {
  return (a - b + 2 * mod) % mod;
}

struct Matrix {
  vector< vector<long long> >  a = vector< vector<long long> > (c, vector<long long> (c, 0));
  Matrix operator *(const Matrix& another) {
    Matrix product;
    for(int i = 0; i < c; i++) {
      for(int j = 0; j < c; j++) {
        for(int k = 0; k < c; k++) {
          product.a[i][k] = add(product.a[i][k], mult(a[i][j], another.a[j][k]));
        }
      }
    }
    return product;
  }
 
};
 
Matrix binpow(Matrix a, long long power) {
  power--;
  Matrix answ = a;
 
  while(power > 0) {
    if(power & 1) {
      answ = answ * a;
    }
 
    a = a * a;
    power /= 2;
  }
 
  return answ;
}

void solve_() {
  cin >> r >> c >> q;

  Matrix mt;
  for(int i = 0; i < c; i++) {
    for(int j = 0; j < c; j++) {
      if(abs(i - j) <= 1) {
        mt.a[i][j] = 1;
      }
    }
  }

  mt = binpow(mt, r - 1);

  while(q--) {
    char t; cin >> t;
    long long c1, c2; cin >> c1 >> c2;

    if(t == 'P') {
      if(c1 != c2) {
        cout << "0 0" << '\n';
      } else {
        cout << r - 1 << " " << 1 << '\n';
      }
    } else if(t == 'R') {
      if(c1 == c2) {
        cout << "1 1" << '\n';
      } else {
        cout << "2 2" << '\n';
      }
    } else if(t == 'K') {
      cout << r - 1 << " " << mt.a[c1 - 1][c2 - 1] << '\n';
    }
  }
}


int main() {
  setIO();

  auto solve = [&](int test_case)-> void {
    for(int i = 1; i <= test_case; i++) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

chessrush.cpp: In function 'void setIO(std::string)':
chessrush.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
chessrush.cpp:71:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 29 ms 596 KB Output is correct
3 Correct 23 ms 608 KB Output is correct
4 Correct 1 ms 340 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 29 ms 596 KB Output is correct
3 Correct 23 ms 608 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 20 ms 596 KB Output is correct
8 Correct 29 ms 664 KB Output is correct

Subtask #7
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 29 ms 596 KB Output is correct
3 Correct 23 ms 608 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 20 ms 596 KB Output is correct
8 Correct 29 ms 664 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 6 ms 336 KB Output is correct
11 Correct 158 ms 660 KB Output is correct
12 Correct 143 ms 664 KB Output is correct
13 Correct 4 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #8
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 29 ms 596 KB Output is correct
3 Correct 23 ms 608 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 20 ms 596 KB Output is correct
8 Correct 29 ms 664 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 6 ms 336 KB Output is correct
11 Correct 158 ms 660 KB Output is correct
12 Correct 143 ms 664 KB Output is correct
13 Correct 4 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 4 ms 340 KB Output is correct
16 Correct 5 ms 340 KB Output is correct
17 Execution timed out 2033 ms 31700 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #9
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -