답안 #559874

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
559874 2022-05-10T21:04:26 Z Sam_a17 Automobil (COCI17_automobil) C++17
55 / 100
23 ms 23828 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 pf push_front
#define popf pop_front
#define popb pop_back

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> void print(set <T> v);
template <class T> void print(vector <T> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T, class V> void print(pair <T, V> p);
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(deque<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, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'

// 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 != "" && str != "input") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }

  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef unsigned long long int ull;

const ull mod = 1e9 + 7;
int n, m, k;

void solve_() {
  cin >> n >> m >> k;
  vector<ull> row(n + 1, 1), col(m + 1, 1);
  vector<ull> colSum(m + 1, 1);

  for(int i = 1; i <= k; i++) {
    char ch; ull x, y;
    cin >> ch >> x >> y;
    if(ch == 'R') {
      row[x] *= y;
      row[x] %= mod;
    } else {
      col[x] *= y;
      col[x] %= mod;
    }
  }

  for(int i = 1; i <= m; i++) {
    colSum[i] = (i * n) % mod;
    ull curr = (n * (n - 1) / 2) % mod;
    curr *= m, curr %= mod;
    colSum[i] += curr;
    colSum[i] %= mod;
  }

  ull s = 0, toadd = 0;
  for(int i = 1; i <= n; i++) {
    if(row[i] == 1) continue;
    ull currValue = 1 + (i - 1) * m;
    currValue %= mod;

    colSum[1] += currValue * (row[i] - 1);
    colSum[1] %= mod;

    s += currValue * (row[i] - 1);
    s %= mod;

    toadd += row[i] - 1;
    toadd %= mod;
  }

  for(int i = 2; i <= m; i++) {
    s += toadd; s %= mod;
    colSum[i] += s; colSum[i] %= mod;
  }

  ull ansi = 0;
  for(int i = 1; i <= m; i++) {
    colSum[i] *= col[i];
    colSum[i] %= mod;
    ansi += colSum[i];
    ansi %= mod;
  }

  printf("%lld\n", ansi);
}

int main() {
  setIO();

  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };

  int test_cases = 1;
  solve(test_cases);

  return 0;
}

Compilation message

automobil.cpp: In function 'void setIO(std::string)':
automobil.cpp:66:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
automobil.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
automobil.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("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
automobil.cpp:72:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Incorrect 3 ms 3796 KB Output isn't correct
12 Incorrect 10 ms 11712 KB Output isn't correct
13 Correct 2 ms 1360 KB Output is correct
14 Incorrect 10 ms 13140 KB Output isn't correct
15 Incorrect 11 ms 13012 KB Output isn't correct
16 Incorrect 20 ms 23828 KB Output isn't correct
17 Incorrect 23 ms 23764 KB Output isn't correct
18 Incorrect 20 ms 23828 KB Output isn't correct
19 Incorrect 21 ms 23824 KB Output isn't correct
20 Incorrect 21 ms 23824 KB Output isn't correct