1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T79d,#include using namespace std; #define int long long struct range { int l, r; void merge(range rng) { l = max(l, rng.l); r = min(r, rng.r); } bool include(int t) { return l <= t && t <= r; } }; range numbers[201]; range positions[201]; struct biparite { int n, m, s; vector match, seen; vector> adj; biparite(int _n, int _m) { n = _n, m = _m; match.resize(m, -1); seen.resize(n, -1); adj.resize(n); } void addedge(int u, int v) { adj[u].push_back(v); } bool dfs(int i) { if(seen[i] == s) return 0; seen[i] = s; for(int a: adj[i]) { if(match[a] == -1 || dfs(match[a])) { match[a] = i; return 1; } } return 0; } int solve() { int ans = 0; for(int i = 0; i < n; i++) { s = i; if(dfs(i)) ans++; } return ans; } }; int32_t main() { cin.tie(0)->sync_with_stdio(0); int n, m; cin >> n >> m; for(int i = 1; i <= n; i++) { numbers[i] = positions[i] = {1, n}; } for(int i = 0; i < m; i++) { int t, x, y, v; cin >> t >> x >> y >> v; numbers[v].merge({x, y}); for(int j = x; j <= y; j++) { if(t == 1) { positions[j].merge({1, v});

코드 #5983