QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #705022 | #6765. Don't Really Like How The Story Ends | beamishboys | WA | 208ms | 3804kb | C++23 | 685b | 2024-11-02 21:54:38 | 2024-11-02 21:54:41 |
Judging History
answer
#include <iostream>
#include <vector>
#include <set>
using namespace std;
using vi = vector<int>;
void solve() {
int n, m; cin >> n >> m;
vector<set<int, greater<int>>> adj(n+1);
for (int i = 0; i < m; i++) {
int u, v; cin >> u >> v;
adj[u].insert(v);
adj[v].insert(u);
}
vi st;
st.push_back(1);
int out = 0;
while (st.size()) {
int top = st.back();
st.pop_back();
if (top == n) break;
for (int i : adj[top]) {
if (i > top) {
st.push_back(i);
}
}
if (st.size() && st.back() == top+1) continue;
out++;
st.push_back(top+1);
}
cout << out << endl;
}
int main() {
int t; cin >> t;
while (t--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3804kb
input:
3 2 3 1 1 1 2 2 1 4 1 1 4 4 2 1 2 3 4
output:
0 2 1
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 208ms
memory: 3568kb
input:
117747 3 7 2 1 3 3 1 3 1 1 3 2 1 1 3 1 4 8 2 3 4 3 3 2 4 2 1 3 2 1 4 3 2 4 3 4 2 3 2 2 3 3 1 1 2 5 1 1 2 2 2 2 1 2 2 2 3 7 2 1 1 2 3 3 3 2 1 2 3 3 3 2 4 5 1 2 3 3 4 4 1 4 2 1 3 1 3 2 1 3 1 1 1 1 1 1 1 6 1 1 1 1 1 1 1 1 1 1 1 1 5 4 2 1 2 5 1 3 3 2 4 7 1 1 2 4 3 2 1 1 1 1 4 2 2 3 5 8 3 3 2 2 4 2 1 4 1...
output:
0 0 1 0 0 1 1 0 0 1 1 1 0 0 2 0 2 0 1 0 0 3 0 0 0 2 1 1 1 0 0 0 2 0 3 1 3 0 2 0 3 1 2 1 0 0 1 2 0 2 0 1 2 0 0 2 0 0 0 1 0 3 0 1 0 0 1 0 0 3 2 0 0 0 1 0 2 3 0 1 1 1 1 0 0 2 1 3 0 1 2 0 0 0 3 0 0 3 1 0 2 0 0 0 1 0 1 0 0 0 0 4 0 0 0 0 0 0 2 0 2 1 0 1 1 0 0 2 0 1 0 0 0 2 0 1 2 1 0 0 0 1 0 0 1 1 1 0 0 0 ...
result:
wrong answer 35th lines differ - expected: '2', found: '3'