結果
問題 | No.11 カードマッチ |
ユーザー | shihu |
提出日時 | 2024-09-26 09:15:03 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 6 ms / 5,000 ms |
コード長 | 1,984 bytes |
コンパイル時間 | 5,542 ms |
コンパイル使用メモリ | 294,928 KB |
実行使用メモリ | 11,136 KB |
最終ジャッジ日時 | 2024-09-26 09:15:15 |
合計ジャッジ時間 | 6,274 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 19 |
ソースコード
// #pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;using mint = modint998244353;// using mint = modint1000000007;using ll = long long;using ull = unsigned long long;using ld = long double;using pii = pair<int, int>;using pll = pair<ll, ll>;using T = tuple<int, int, int>;using G = vector<vector<int>>;#define rep(i, n) for (ll i = 0; i < (n); ++i)#define rep2(i, a, b) for (ll i = a; i < (b); ++i)#define rrep2(i, a, b) for (ll i = a-1; i >= (b); --i)#define rep3(i, a, b, c) for (ll i = a; i < (b); i+=c)#define rng(a) a.begin(),a.end()#define rrng(a) a.rbegin(),a.rend()#define popcount __builtin_popcount#define popcountll __builtin_popcountll#define fi first#define se second#define UNIQUE(v) sort(rng(v)), v.erase(unique(rng(v)), v.end())#define MIN(v) *min_element(rng(v))#define MAX(v) *max_element(rng(v))template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}template<class T> void printv(vector<T> &v){rep(i,v.size())cout<<v[i]<<" \n"[i==v.size()-1];}template<class T> void printvv(vector<vector<T>> &v){rep(i,v.size())rep(j,v[i].size())cout<<v[i][j]<<" \n"[j==v[i].size()-1];cout<<endl;}const ll dx[] = {0, 1, 0, -1};const ll dy[] = {1, 0, -1, 0};const ll dxx[] = {0, 1, 0, -1, 1, -1, 1, -1};const ll dyy[] = {1, 0, -1, 0, 1, 1, -1, -1};const ll LINF = 1001002003004005006ll;const int INF = 1001001001;int main(){ios::sync_with_stdio(false);cin.tie(nullptr);int h, w, n; cin >> w >> h >> n;vector<int> x(w), y(h);rep(i, n){int s, k; cin >> s >> k; s--, k--;x[s]++;y[k]++;}int xs = 0, ys = 0;rep(i, w) if (x[i]) xs++;rep(i, h) if (y[i]) ys++;ll ans = (ll)xs*h+(ll)ys*w-xs*ys;ans -= n;cout << ans << endl;return 0;}