QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#604611 | #8760. 不等式 | xing4c# | WA | 3ms | 16216kb | C++14 | 1.5kb | 2024-10-02 12:28:25 | 2024-10-02 12:28:26 |
Judging History
answer
#include <bits/stdc++.h>
#define NOSYNC ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define all(x) x.begin(), x.end()
#define endl '\n'
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int N = 200005;
// -------------- Templates Above -------------------------
int a[N]; int n, m;
vector<int> G[N];
int vis[N]; int d[N];
vector<int> ano[N];
int tag[N], in[N];
void dfs(int x) {
if(tag[x]) return;
tag[x] = 1;
if(G[x].empty() ) {
a[x] = 1;
return;
}
for(int y : G[x]) {
if(tag[y]) continue;
dfs(y);
}
for(int y : G[x]) {
for(int z : ano[y]) {
a[x] = max(a[x], a[y] + a[z]);
}
}
}
signed main() {
NOSYNC;
cin >> n >> m;
for(int i = 1; i <= m; i ++) {
int x, y, z;
cin >> x >> y >> z;
G[x].push_back(y);
G[x].push_back(z);
++ d[y]; ++ d[z];
ano[y].push_back(z);
ano[z].push_back(y);
++ in[y]; ++ in[z];
}
queue<int> q;
for(int i = 1; i <= n; i ++) {
if(!d[i]) {
q.push(i);
}
}
while(!q.empty()) {
int u = q.front(); q.pop();
vis[u] = 1;
for(int v : G[u]) {
-- d[v];
if(!d[v]) {
q.push(v);
}
}
}
for(int i = 1; i <= n; i ++) {
if(!vis[i]) {
cout << -1 << endl;
return 0;
}
}
for(int i = 1; i <= n; i ++) {
if(!in[i] && !tag[i]) dfs(i);
}
int ans = 0;
for(int i = 1; i <= n; i ++) {
ans += a[i];
if(!a[i]) ans ++;
}
cout << ans << endl;
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 15988kb
input:
3 1 1 2 2
output:
4
result:
ok 1 number(s): "4"
Test #2:
score: 0
Accepted
time: 0ms
memory: 15800kb
input:
3 1 1 2 3
output:
4
result:
ok 1 number(s): "4"
Test #3:
score: 0
Accepted
time: 2ms
memory: 14704kb
input:
3 1 1 2 2
output:
4
result:
ok 1 number(s): "4"
Test #4:
score: 0
Accepted
time: 0ms
memory: 15904kb
input:
3 1 1 2 2
output:
4
result:
ok 1 number(s): "4"
Test #5:
score: 0
Accepted
time: 2ms
memory: 14544kb
input:
3 1 1 2 2
output:
4
result:
ok 1 number(s): "4"
Test #6:
score: 0
Accepted
time: 2ms
memory: 16216kb
input:
5 1 1 2 2
output:
6
result:
ok 1 number(s): "6"
Test #7:
score: 0
Accepted
time: 0ms
memory: 16172kb
input:
5 1 1 2 2
output:
6
result:
ok 1 number(s): "6"
Test #8:
score: 0
Accepted
time: 0ms
memory: 14544kb
input:
5 1 1 2 2
output:
6
result:
ok 1 number(s): "6"
Test #9:
score: 0
Accepted
time: 2ms
memory: 14740kb
input:
5 1 1 2 3
output:
6
result:
ok 1 number(s): "6"
Test #10:
score: 0
Accepted
time: 0ms
memory: 15856kb
input:
5 2 1 2 3 2 3 4
output:
8
result:
ok 1 number(s): "8"
Test #11:
score: 0
Accepted
time: 2ms
memory: 14704kb
input:
10 1 1 2 3
output:
11
result:
ok 1 number(s): "11"
Test #12:
score: 0
Accepted
time: 2ms
memory: 15904kb
input:
10 1 1 2 2
output:
11
result:
ok 1 number(s): "11"
Test #13:
score: 0
Accepted
time: 0ms
memory: 14560kb
input:
10 2 1 2 3 2 3 4
output:
13
result:
ok 1 number(s): "13"
Test #14:
score: 0
Accepted
time: 3ms
memory: 14564kb
input:
10 2 1 2 2 2 3 4
output:
14
result:
ok 1 number(s): "14"
Test #15:
score: -100
Wrong Answer
time: 0ms
memory: 14756kb
input:
10 3 1 2 3 1 8 8 2 3 3
output:
15
result:
wrong answer 1st numbers differ - expected: '13', found: '15'