Submission #523654

#TimeUsernameProblemLanguageResultExecution timeMemory
523654boykut결혼 문제 (IZhO14_marriage)C++14
50 / 100
1598 ms59132 KiB
#include <bits/stdc++.h> using namespace std; vector<vector<char>> dp; int n, m, k; int check(int l, int r) { if (r - l + 1 < m) return 0; vector<int> mas(m + 1, 0); for (int j = 1; j <= m; j++) { for (int i = l; i <= r; i++) { mas[j] |= dp[j][i]; } } return (count(mas.begin(), mas.end(), 0) == 1 ? 1 : 0); } int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m >> k; dp = vector<vector<char>> (1 + m, vector<char>(1 + n, 0)); for (int i = 0; i < k; i++) { int a, b; cin >> a >> b; dp[b][a] = 1; } long long ans = 0; for (int l = 1, r = 1; l <= n; l++) { while (r <= n && !check(l, r)) r++; if (r <= n) { ans += n - r + 1; } } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...