QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#668892 | #906. 强连通分量 | lycc | WA | 3ms | 5960kb | C++20 | 2.2kb | 2024-10-23 16:28:04 | 2024-10-23 16:28:04 |
Judging History
answer
#include <bits/stdc++.h>
// #define int long long
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define pb emplace_back
#define For(i, x, y) for (int i = (x); i <= (y); i ++)
#define rep(i, x, y) for (int i = (x); i >= (y); i --)
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define sz(v) (int)((v).size())
#define ull unsigned long long
#define ls (p << 1)
#define rs (p << 1 | 1)
#define mp make_pair
#define i128 __int128
#define db long double
#define vi vector< int >
#define mem(v, x) memset(v, x, sizeof(v))
#define A3 array< int, 3 >
#define A4 array< int, 4 >
#define vpii vector< pair< int, int > >
using namespace std;
mt19937_64 rnd(time(0));
template< typename T > void cmin(T &x, T y) { return x = min(x, y), void(); }
template< typename T > void cmax(T &x, T y) { return x = max(x, y), void(); }
int ksm(int x, int y, int p) {
int v = 1; x %= p;
while (y) v = 1ll * v * ((y & 1) ? x : 1) % p, x = 1ll * x * x % p, y >>= 1;
return (v % p + p) % p;
}
bool MemoryST;
const int N = 5e5 + 5;
const int mod = 998244353;
const long long INF = 1e18;
const int base = 13131;
int n, m;
vi e[N];
int dfn[N], low[N], num;
bool flag[N];
stack< int > st;
vi pos[N];
int tot;
void dfs(int x) {
dfn[x] = low[x] = ++ num; st.push(x); flag[x] = 1;
for (int y : e[x])
if (!dfn[y]) dfs(y), cmin(low[x], low[y]);
else if (flag[y]) cmin(low[x], dfn[y]);
if (dfn[x] == low[x]) {
tot ++;
while (sz(st)) {
int y = st.top(); st.pop();
flag[y] = 0; pos[tot].pb(y);
if (y == x) return;
}
}
return;
}
void Main() {
cin >> n >> m;
For (i, 1, m) {
int x, y; cin >> x >> y; x ++; y ++;
e[x].pb(y);
}
For (i, 1, n) if (!dfn[i]) dfs(i);
cout << tot << '\n';
For (i, 1, tot) {
cout << sz(pos[i]) << ' ';
for (int x : pos[i]) cout << x - 1 << ' ';
cout << '\n';
}
return;
}
bool MemoryED;
signed main() {
ios :: sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cerr << fixed << setprecision(6) << (&MemoryST - &MemoryED) / 1048576.0 << "MB\n";
int TESTCNT = 1;
// cin >> TESTCNT;
while (TESTCNT --) Main();
cerr << endl << 1e3 * clock() / CLOCKS_PER_SEC << "ms";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 3ms
memory: 5960kb
input:
6 7 1 4 5 2 3 0 5 5 4 1 0 3 4 2
output:
4 2 3 0 1 2 2 4 1 1 5
result:
wrong answer 5 is later than 2, but there is an edge (5, 2)