Submission #632224

#	Time	Username	Problem	Language	Result	Execution time	Memory
632224		gs14004	Bread First Search (CCO21_day2problem2)	C++17	11 / 25	2086 ms	5584 KiB

Main

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = pair<int, int>;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
const int MAXN = 1005;
const int mod = 1e9 + 7;

int main(){	
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n, m;
	cin >> n >> m;
	vector<int> L(n, 1e9), R(n, -1e9), dp(n + 1), nxt(n, 1e9);
	for(int i = 0; i < m; i++){
		int u, v; cin >> u >> v;
		u--; v--;
		if(u > v) swap(u, v);
		R[u] = max(R[u], v);
		L[v] = min(L[v], u);
	}
	for(int i = 0; i < n; i++){
		nxt[i] = R[i];
		if(i) nxt[i] = max(nxt[i], nxt[i - 1]);
	}
	vector<pi> swp;
	for(int i = 0; i < n; i++) swp.emplace_back(min(i, L[i]), i);
	sort(all(swp)); 
	for(int i = n - 1; i >= 1; i--){
		while(sz(swp) && swp.back().first >= i){
			for(int k = swp.back().second + 1; k <= n; k++) dp[k]++;
			swp.pop_back();
		}
		dp[i] = 1e9;
		int cnt = 0;
		for(int j = max(i, nxt[i - 1]) + 1; j <= n; j++){
			dp[i] = min(dp[i], dp[j]);
		}
	}
	cout << dp[1] << "\n";
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:37:7: warning: unused variable 'cnt' [-Wunused-variable]
   37 |   int cnt = 0;
      |       ^~~

• Subtask 1: 5 / 5
• Subtask 2: 6 / 6
• Subtask 3: 0 / 14