Submission #405699

# Submission time Handle Problem Language Result Execution time Memory
405699 2021-05-16T19:22:08 Z Aryan_Raina Plus Minus (BOI17_plusminus) C++17
100 / 100
193 ms 15704 KB
#include <bits/stdc++.h>
using namespace std; 
 
#define int int64_t
#define ld long double
#define ar array
 
const int INF = 1e17;
const int MOD = 1e9+7;
 
int32_t main() {
   ios_base::sync_with_stdio(0);
   cin.tie(0); cout.tie(0);
 
   int N, M, K; cin >> N >> M >> K;
   vector<ar<int,3>> A(K);
   for (auto &i : A) {
      char ch; cin >> ch >> i[1] >> i[2];
      i[0] = ch == '+';
   }

   map<int,vector<ar<int, 2>>> remdi;
   for (auto &[t, x, y] : A) remdi[x].push_back({y, t}); 
   int sol1 = N;
   for (auto [x, v] : remdi) {
      int sy = v[0][0], st = v[0][1];
      for (auto [y, t] : v) if ((abs(y - sy) & 1) != abs(t - st)) sol1 = -1;
      sol1--;
   }  

   remdi.clear(); int sol2 = M;
   for (auto &[t, x, y] : A) remdi[y].push_back({x, t});
   for (auto [y, v] : remdi) {
      int sx = v[0][0], st = v[0][1];
      for (auto [x, t] : v) if ((abs(x - sx) & 1) != abs(t - st)) sol2 = -1;
      sol2--;
   }

   auto pow = [&](int p)->int {
      if (p < 0) return 0LL;
      int res = 1, cur = 2;
      while (p) {
         if (p & 1) res = (res * cur) % MOD;
         cur = (cur * cur) % MOD; p >>= 1;
      }
      return res;
   };

   cout << (pow(sol1) + pow(sol2) - (sol1 >= 0 && sol2 >= 0) - (K == 0)) % MOD;   
}  
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 44 ms 5988 KB Output is correct
17 Correct 44 ms 5956 KB Output is correct
18 Correct 46 ms 5964 KB Output is correct
19 Correct 49 ms 5956 KB Output is correct
20 Correct 43 ms 5928 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 44 ms 5988 KB Output is correct
17 Correct 44 ms 5956 KB Output is correct
18 Correct 46 ms 5964 KB Output is correct
19 Correct 49 ms 5956 KB Output is correct
20 Correct 43 ms 5928 KB Output is correct
21 Correct 131 ms 11204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 157 ms 11260 KB Output is correct
24 Correct 132 ms 11212 KB Output is correct
25 Correct 139 ms 11268 KB Output is correct
26 Correct 141 ms 13140 KB Output is correct
27 Correct 146 ms 13144 KB Output is correct
28 Correct 142 ms 13120 KB Output is correct
29 Correct 143 ms 13144 KB Output is correct
30 Correct 193 ms 15704 KB Output is correct