답안 #345320

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
345320 2021-01-07T07:18:34 Z maskoff 결혼 문제 (IZhO14_marriage) C++14
컴파일 오류
0 ms 0 KB
#include <bits/stdc++.h>

#define file ""

#define all(x) x.begin(), x.end()

#define sc second
#define fr first

#define pb push_back
#define mp make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const ll inf = 1e18 + 5;
const ll mod = 1e9 + 7;

const int N = 5e5 + 5;

int dx[] = {+1, 0, -1, 0};
int dy[] = {0, +1, 0, -1};


int n, m, k, timer;
int used[N], mt[N], pr[N];
vector<int> g[N], all[N];

bool go(int v) {
	if (used[v] == timer) return false;
	used[v] = timer;
 	for (int to : g[v]) 
 		if (mt[to] == false) {
 		 	mt[to] = v;
 		 	pr[v] = to;
 		 	return true;
 		}    
	for (int to : g[v])
		if (go(mt[to])) {
		 	mt[to] = v;
		 	pr[v] = to;
		 	return true;
		}
	return false;
}

bool check(int y, int p) {
	fill (pr + 1, pr + 1 + m, false);
	for (int i = 1; i <= m; i++)
		g[i].clear();
	for (int i = y; i <= p; i++) {
	 	for (int j : all[i])
	 		g[j].pb(i);
	}
	for (int i = 1; i <= m; i++) {
		timer++;
		go(i);
	}
	int ok = true;
	for (int i = 1; i <= m; i++) 
		if (pr[i] == 0) ok = false;
		else mt[pr[i]] = false;
	return ok;
}

int main() {   
	ios_base :: sync_with_stdio(false);               
	cin.tie(nullptr);
	srand(time(nullptr));
	cin >> n >> m >> k;
	for (int x, y, i = 1; i <= k; i++) {
		cin >> x >> y;
	 	all[x].pb(y);
	}
	ll res = 0;
	int j = 1;
	for (int i = 1; i <= n; i++) {
		if (j == n + 1) if (check(i, n)) {ans++, continue;}
		int p = check(i, j);
		while (j <= n && !p) {
		 	j++;
		 	p = check(i, j);
		}
		if (p) res += n - j + 1;
		else break;
	}
	cout << res;
  return 0;              
}

Compilation message

marriage.cpp: In function 'int main()':
marriage.cpp:80:37: error: 'ans' was not declared in this scope; did you mean 'abs'?
   80 |   if (j == n + 1) if (check(i, n)) {ans++, continue;}
      |                                     ^~~
      |                                     abs
marriage.cpp:80:44: error: expected primary-expression before 'continue'
   80 |   if (j == n + 1) if (check(i, n)) {ans++, continue;}
      |                                            ^~~~~~~~