| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1306377 | vahagng | Marriage questions (IZhO14_marriage) | C++20 | 0 ms | 0 KiB |
//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
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++) { cerr << v[i] << " "; } 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 << "]"; }
#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'
const ll inf = 2e18, mod = 1e9 + 7, mod2 = 998244353;
void SetIO(string str = "") {
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
else {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
void FastIO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
const int N = 5e5 + 10, M = 1e7 + 10;
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
ll binpow(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % mod2;
}
b >>= 1;
a = (a * a) % mod2;
}
return res;
}
ll n, m, k, a[N], b[N];
vector<int>adj[N];
bool visited[N];
int match[N];
bool dfs(int node, int l, int r){
for(auto i : adj[node]){
if(i < l || i > r) continue;
if(visited[i]) continue;
visited[i] = 1;
if(match[i] == -1 || dfs(match[i], l, r)){
match[i] = node;
return 1;
}
}
return 0;
}
int max_matching(int l, int r){
for(int i = 1; i <= n; i++){
match[i] = -1;
}
int r = 0;
for(int i = 1; i <= m; i++){
for(int j = 1; j <= n; j++){
visited[j] = 0;
}
if(dfs(i, l, r)) r++;
}
return r;
}
void solve(int tc) {
cin >> n >> m >> k;
for(int i = 1; i <= k; i++){
cin >> a[i] >> b[i];
adj[b[i]].push_back(a[i]);
}
int ans = 0;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
adj[j].clear();
}
for(int j = i + m - 1; j <= n; j++){
int mx = max_matching(i, j);
ans += (mx == m);
}
}
cout << ans << endl;
}
void precalc() {
}
int main() {
// SetIO("teamwork");
FastIO();
int test_case = 1;
// cin >> test_case;
precalc();
int cnt = 1;
while (test_case--) {
solve(cnt++);
}
return 0;
}