/*
.:*+=%@@@@@@=-.
.:=@#@@@#@@#######%==*.
.-=####@######%*-.....:%##%.
.*@###########%+:--........-%@-
.*@##############@+--.........-:%-
.+##################@==%%%%=+*:----+.
.-@####################%++%@@@@@=+**%@@*
.%###################@%%@@@###@%+:--%@@%.
-@###################@%%%%*::*%++:-----=@+.
-#####################@%=++++++*:-------.-=:
.+####################@%++*::-:::--::*:::***=:
.@#####################%=++*::::-:::++*=##@@#@-
..#####################@%%=++**:::::**+%@#@%%##-..
.%####################@@%=+++*+****::*=@######@.
.=######################@%%==+==++**+=@%@##@###+:...
-#######################@@@%%%===++=@@@%=++===*::--...
-########################@@@@@@@%==%%=++==@@:::::*:--.
..:#########################@@@@@@%%======++++::-..:-.--...
%#############################@###@%%@@%==%=%*----.--.::---.
#############################################*-:*:-:---*---- .
#############################################*--*--:---*---:-.
#############################################+--::--::-*::-::.
###########################################+:*-.---.---.:---*-..
###########################################**:-----------------.
##########################################@::**:--::::::--:::::-
###########################################:--:*:::::::::**::*+*
###########################################=:::***::::::**:::*+*
############################@@@@@@#########@+****::::********+++
############################@%%%%%@@@@@@@###%+***::::::::***+==+
############################@%%%%%%%%%%%@####=+:::-::::-::*+=%%+
#############################@%%%%%%%%%%@#####=::--------:*=%@%+
%###########################@%%%%==%%%%%%@##@#=:------..-:+%@@%=
----------------------------------------------
--------------------------------------------
----------------------------------------------
--------------------------------------------
----------------------------------------------
o###########oo
o##" ""##o
o#" "##
o#" "#o
#" ## ## "##
#" ##
# ################### #
# #
# #
# #
# #
# #
# #
#o #
"#o ##
"#o ##
"#o o#"
"#o ##
"#o o#"
"#ooo ooo#######oo
############### "######o
o###"" "###o # ###
o###o oooo ### oo####"
o###**# #**# ############"
""##""""""""""########### #
# oooooooo#"#** ## #
# # # # ** ## #
#o# #o# *****###ooo#
##
## o###o
## o##***##
o########## #***#**##o
o##" ""### #***##***#
o#######o ### oo#### ##**####*#
o##" ""#############"" ##****###
##" ## ##*##*###
## ### ##### ##
## ### # ## #
## ## #
## ##
## ###
## ###oo
### ""###
###
###
*/
#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#pragma GCC target("avx,tune=native")
//float __attribute__((aligned(32)))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
int mysqrt(ll x){
int l = 0, r = 1e9 + 1;
while (r - l > 1){
int m = (l + r) / 2;
if (m * (ll)m <= x)
l = m;
else
r = m;
}
return l;
}
mt19937 rnd(1337);
ll AR = 19, BR = 13, CR = 23, XR = 228, YR = 322, MODR = 1e9 + 993;
ll myrand(){
ll ZR = (XR * AR + YR * BR + CR) % MODR;
XR = YR;
YR = ZR;
return ZR;
}
const int Mod = 1e9 + 7;
int bpow(int x, int y){
if (y == 0)
return 1;
if (y == 1)
return x;
int ret = bpow(x, y >> 1);
ret = (ret * (ll)ret) % Mod;
if (y & 1)
ret = (ret * (ll)x) % Mod;
return ret;
}
int bdiv(int x, int y){
return (x * (ll)bpow(y, Mod - 2)) % Mod;
}
void setmin(int &x, int y){
x = min(x, y);
}
void setmax(int &x, int y){
x = max(x, y);
}
const ll llinf = 1e18 + 100;
const int maxn = 1e5 + 100, inf = 2e9 + 100, sq = 300, mod = 1e9 + 7, LG = 17;
int mt[30000];
bool used[2000];
int n, m, edg;
vector<int> e[2000];
bool vis[30000];
int L, R;
int mat;
bool go(int v){
for (auto i : e[v])
if (!vis[i] && i >= L && i < R){
vis[i] = 1;
if (mt[i] == -1 || go(mt[i])){
mt[i] = v;
return 1;
}
}
return 0;
}
void kun(){
for (int i = 0; i < n; i++)
vis[i] = 0;
for (int i = 0; i < m; i++)
if (!used[i]){
if (go(i)){
used[i] = 1;
mat++;
return;
}
}
}
void rem(){
if (mt[L] != -1){
used[mt[L]] = 0;
mat--;
}
L++;
if (mat < m)
kun();
}
int main()
{
#ifdef ONPC
//ifstream cin("a.in");
//ofstream cout("a.out");
freopen("a.in", "r", stdin);
freopen("a.out", "w", stdout);
#else
//ifstream cin("money.in");
//ofstream cout("money.out");
//freopen("money.in", "r", stdin);
//freopen("money.out", "w", stdout);
#endif // ONPC
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> edg;
for (int i = 0; i < edg; i++){
int v, u;
cin >> v >> u;
e[u - 1].push_back(v - 1);
}
for (int i = 0; i < n; i++)
mt[i] = -1;
for (int i = 0; i < m; i++)
sort(e[i].begin(), e[i].end());
int ans = 0;
for (int i = 0; i < n; i++){
while (R < n && mat < m)
R++, kun();
if (mat < m)
break;
ans += n - R + 1;
rem();
}
cout << ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 9 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 11 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 12 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 13 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 14 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 15 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 16 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 17 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 18 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 19 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 20 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 21 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 22 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 23 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 24 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 25 |
Correct |
13 ms |
2380 KB |
Output is correct |
| 26 |
Correct |
3 ms |
2380 KB |
Output is correct |
| 27 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 28 |
Correct |
0 ms |
2380 KB |
Output is correct |
| 29 |
Correct |
3 ms |
2380 KB |
Output is correct |
| 30 |
Correct |
3 ms |
2380 KB |
Output is correct |
| 31 |
Correct |
106 ms |
2644 KB |
Output is correct |
| 32 |
Correct |
6 ms |
2380 KB |
Output is correct |
| 33 |
Correct |
3 ms |
2380 KB |
Output is correct |
| 34 |
Correct |
3 ms |
2380 KB |
Output is correct |
| 35 |
Correct |
63 ms |
2908 KB |
Output is correct |
| 36 |
Correct |
43 ms |
2908 KB |
Output is correct |
| 37 |
Correct |
406 ms |
2644 KB |
Output is correct |
| 38 |
Correct |
63 ms |
2908 KB |
Output is correct |
| 39 |
Correct |
209 ms |
2380 KB |
Output is correct |
| 40 |
Correct |
149 ms |
2380 KB |
Output is correct |
| 41 |
Correct |
176 ms |
2512 KB |
Output is correct |
| 42 |
Correct |
553 ms |
2512 KB |
Output is correct |
| 43 |
Correct |
719 ms |
2644 KB |
Output is correct |
| 44 |
Correct |
1086 ms |
2908 KB |
Output is correct |
| 45 |
Correct |
916 ms |
2512 KB |
Output is correct |
| 46 |
Correct |
1316 ms |
2908 KB |
Output is correct |
| 47 |
Execution timed out |
1500 ms |
2908 KB |
Execution timed out |
| 48 |
Execution timed out |
1500 ms |
2908 KB |
Execution timed out |
| 49 |
Correct |
1423 ms |
2908 KB |
Output is correct |
| 50 |
Correct |
959 ms |
2380 KB |
Output is correct |
