| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 87039 | sh25_zhangyy | 校门外的树 | C++ | Accepted | 1 MS | 264 KB | 386 | 2026-04-10 15:22:29 |
#include <bits/stdc++.h> using namespace std; int l, m, u, v, sum; bool has[10010]; int main() { cin >> l >> m; fill(has, has + l + 1, true); for(int i = 1; i <= m; i++) { cin >> u >> v; for(int j = u; j <= v; j++) has[j] = false; } for(int i = 0; i <= l; i++) sum += has[i]; cout << sum; return 0; }