QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#197334 | #6526. Canvas | ucup-team870 | WA | 17ms | 65480kb | C++17 | 2.9kb | 2023-10-02 14:44:43 | 2023-10-02 14:44:43 |
Judging History
answer
#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=l; i<=r; i++)
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
const int N = 1000010;
vector <int> ef[N];
vector <P> eb[N];
int ans[N], tag[N], ss, tt, inq[N], sum, rere[N], yes[N], inst[N], num, bel[N];
ll low[N];
ll tim, dfn[N];
set<P> ksj;
void erase(int s) {
queue <int> q;
q.push(s);
inq[s] = 1;
ksj.erase(P(dfn[s], s));
sum += 1;
// cout <<s<<"#\n";
while (!q.empty()) {
int u = q.front();
q.pop();
ksj.erase(P(dfn[u], u));
for (auto t: eb[u]) {
int v = t.first;
ans[t.second] = tt--;
if (!inq[v]) q.push(v), inq[v] = 1,sum += 2;
}
}
}
stack<int> st;
void dfs(int u) {
dfn[u] = low[u] = --tim;
st.push(u), inst[u] = 1;
for (auto v: ef[u]) {
if (!dfn[v]) dfs(v), low[u] = max(low[u], low[v]);
else if (inst[v]) low[u] = max(low[u], low[v]);
}
if (low[u] == dfn[u]) {
int now;
num++;
do {
now = st.top();
st.pop();
bel[now] = num;
inst[now] = 0;
} while (now != u);
}
}
int main() {
int T; scanf("%d", &T);
while (T--) {
int n, m; scanf("%d%d", &n, &m);
ss = 1, tt = m;
rep (i, 1, m) {
int l, r, x, y;
scanf("%d%d%d%d", &l, &x, &r, &y);
yes[l] = yes[r] = 1;
if (x == 1 && y == 1) {
ans[i] = ss++;
}
else if (x == 2 && y == 2) {
ans[i] = tt--;
tag[l] = tag[r] = 2;
}
else {
if (x < y) swap(l, r), swap(x, y);
ef[l].push_back(r);
eb[r].push_back(P(l, i));
}
}
rep (i, 1, n) {
if (yes[i] && !dfn[i]) dfs(i);//, tim -= 2*n ;
}
rep (i, 1, n) dfn[i] = low[i];
rep (i, 1, n) {
if (yes[i]) ksj.insert(P(dfn[i], i));//, cout << i << ' '<< dfn[i]<<"$$$\n";
}
rep (i, 1, n) {
if (tag[i] == 2 && !inq[i]) {
erase(i);
sum += 1;
}
}
while (ksj.size()) {
int u = (*ksj.begin()).second;
erase(u);
}
cout << sum <<'\n';
rep (i, 1, m) rere[ans[i]] = i;
rep (i, 1, m) {
cout << rere[i] <<' ';
}
cout <<'\n';
rep (i, 1, n) inq[i] = tag[i] = low[i] = dfn[i] = inst[i] = 0, ef[i].clear(), eb[i].clear(), ef[i].shrink_to_fit(), eb[i].shrink_to_fit(), yes[i] =0;
ksj.clear();
while (st.size()) st.pop();
rep (i, 1, m) ans[i] = 0;
sum = 0;
tim = 0;
num=0;
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 64552kb
input:
2 4 4 1 1 2 2 3 2 4 1 1 2 3 2 2 1 4 1 4 2 3 2 4 1 1 2 3 1
output:
7 4 2 1 3 5 2 1
result:
ok Correct. (2 test cases)
Test #2:
score: 0
Accepted
time: 5ms
memory: 63404kb
input:
1 10 13 1 1 2 2 2 1 3 2 1 2 3 1 3 1 4 2 4 1 5 2 5 1 6 2 4 2 6 1 7 1 8 2 8 1 9 2 7 2 9 1 5 2 9 1 8 2 10 2 1 1 10 1
output:
19 13 4 3 2 1 5 7 6 8 11 10 9 12
result:
ok Correct. (1 test case)
Test #3:
score: 0
Accepted
time: 8ms
memory: 64896kb
input:
1 7 5 2 1 6 2 1 2 6 1 1 1 5 1 2 2 7 1 1 1 7 2
output:
8 3 2 1 4 5
result:
ok Correct. (1 test case)
Test #4:
score: -100
Wrong Answer
time: 17ms
memory: 65480kb
input:
1 7 6 2 1 7 2 2 1 4 2 1 2 4 1 2 1 6 1 1 1 6 2 2 2 6 1
output:
8 4 3 2 1 6 5
result:
wrong answer Participant's solution is incorrect. (test case 1)