結果
問題 | No.1338 Giant Class |
ユーザー |
![]() |
提出日時 | 2021-01-16 01:01:17 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 439 ms / 2,000 ms |
コード長 | 3,239 bytes |
コンパイル時間 | 1,873 ms |
コンパイル使用メモリ | 198,940 KB |
最終ジャッジ日時 | 2025-01-17 21:05:05 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 21 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define int long long#define rep(i, n) for (int i = 0; i < (int) (n); i++)#define reps(i, n) for (int i = 1; i <= (int) (n); i++)#define all(a) (a).begin(), (a).end()#define uniq(a) (a).erase(unique(all(a)), (a).end())#define dump(a) cerr << #a " = " << (a) << endlusing vint = vector<int>;using pint = pair<int, int>;using vpint = vector<pint>;template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;constexpr double PI = 3.1415926535897932384626433832795028;constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};int bit(int n) { return 1LL << n; }int sign(int a) { return (a > 0) - (a < 0); }int cdiv(int a, int b) { return (a - 1 + b) / b; }template<typename T> T sq(T a) { return a * a; }template<typename T> void fin(T a) {cout << a << endl;exit(0);}template<typename T, typename U> bool chmax(T &a, const U &b) {if (a < b) {a = b;return true;}return false;}template<typename T, typename U> bool chmin(T &a, const U &b) {if (b < a) {a = b;return true;}return false;}template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &a) {os << "(" << a.first << ", " << a.second << ")";return os;}template<typename T, typename U, typename V> ostream &operator<<(ostream &os, const tuple<T, U, V> &a) {os << "(" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ")";return os;}template<typename T> ostream &operator<<(ostream &os, const vector<T> &a) {os << "(";for (auto itr = a.begin(); itr != a.end(); itr++) {os << *itr << (next(itr) != a.end() ? ", " : "");}os << ")";return os;}template<typename T> ostream &operator<<(ostream &os, const deque<T> &a) {os << "(";for (auto itr = a.begin(); itr != a.end(); itr++) {os << *itr << (next(itr) != a.end() ? ", " : "");}os << ")";return os;}template<typename T> ostream &operator<<(ostream &os, const set<T> &a) {os << "{";for (auto itr = a.begin(); itr != a.end(); itr++) {os << *itr << (next(itr) != a.end() ? ", " : "");}os << "}";return os;}template<typename T> ostream &operator<<(ostream &os, const multiset<T> &a) {os << "{";for (auto itr = a.begin(); itr != a.end(); itr++) {os << *itr << (next(itr) != a.end() ? ", " : "");}os << "}";return os;}template<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &a) {os << "{";for (auto itr = a.begin(); itr != a.end(); itr++) {os << *itr << (next(itr) != a.end() ? ", " : "");}os << "}";return os;}struct setup {static constexpr int PREC = 20;setup() {cout << fixed << setprecision(PREC);cerr << fixed << setprecision(PREC);}} setup;signed main() {int H, W, Q;cin >> H >> W >> Q;int ans = H * W;map<int, int> mp;while (Q--) {int Y, X;cin >> Y >> X;int b = H - Y + 1;ans -= max(0LL, b - mp[X]);cout << ans << endl;chmax(mp[X], b);}}