QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#533726 | #8760. 不等式 | qwetl | WA | 2ms | 13936kb | C++17 | 1.9kb | 2024-08-26 11:59:28 | 2024-08-26 11:59:29 |
Judging History
answer
#include <bits/stdc++.h>
#define Ciallo main
using namespace std;
const int N = 1e6;
inline int read() {
int _x = 0, _w = 1;
char ch = 0;
while (ch < '0' || ch > '9') {
if (ch == '-') _w = -1;
#ifdef __linux__
ch = (char)getchar_unlocked();
#else
ch = (char)_getchar_nolock();
#endif
}
while (ch >= '0' && ch <= '9') {
_x = (_x << 3) + (_x << 1) + (ch - '0');
#ifdef __linux__
ch = (char)getchar_unlocked();
#else
ch = (char)_getchar_nolock();
#endif
}
return _x * _w;
}
inline void write(int _x){
if(_x < 0) {
#ifdef __linux__
putchar_unlocked('-');
#else
_putchar_nolock('-');
#endif
_x = -_x;
}
static int _sta[130];
int _top = 0;
do {
_sta[_top++] = _x % 10, _x /= 10;
} while(_x);
while(_top)
#ifdef __linux__
putchar_unlocked(_sta[--_top] + 48);
putchar_unlocked('\n');
#else
_putchar_nolock(_sta[--_top] + 48);
_putchar_nolock('\n');
#endif
}
int n, m, sum, x, y, z;
int e[N], h[N], ne[N], idx;
int w[N];
int q[N], d[N], hh, tt;
inline void add(int _a, int _b){
e[idx] = _b, ne[idx] = h[_a], h[_a] = idx++;
}
void topoSort(){
for(int i=1; i<=n; i++)
if(!d[i]){
q[tt++] = i;
w[i] = 1;
}
while(hh < tt){
int t = q[hh++];
for(int i=h[t]; i!=-1; i=ne[i]){
int j = e[i];
w[j] += w[t];
d[j]--;
if(!d[j])
q[tt++] = j;
}
}
}
signed Ciallo(){
memset(h, -1, sizeof h);
n = read(), m = read();
while(m--){
x = read(), y = read(), z = read();
add(y, x), add(z, x);
d[x] += 2;
}
topoSort();
for(int i=1; i<=n; i++)
sum += w[i];
write(sum);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 13848kb
input:
3 1 1 2 2
output:
4
result:
ok 1 number(s): "4"
Test #2:
score: 0
Accepted
time: 0ms
memory: 13868kb
input:
3 1 1 2 3
output:
4
result:
ok 1 number(s): "4"
Test #3:
score: 0
Accepted
time: 2ms
memory: 13868kb
input:
3 1 1 2 2
output:
4
result:
ok 1 number(s): "4"
Test #4:
score: 0
Accepted
time: 0ms
memory: 13908kb
input:
3 1 1 2 2
output:
4
result:
ok 1 number(s): "4"
Test #5:
score: 0
Accepted
time: 2ms
memory: 13856kb
input:
3 1 1 2 2
output:
4
result:
ok 1 number(s): "4"
Test #6:
score: 0
Accepted
time: 0ms
memory: 13936kb
input:
5 1 1 2 2
output:
6
result:
ok 1 number(s): "6"
Test #7:
score: 0
Accepted
time: 2ms
memory: 13868kb
input:
5 1 1 2 2
output:
6
result:
ok 1 number(s): "6"
Test #8:
score: 0
Accepted
time: 0ms
memory: 13912kb
input:
5 1 1 2 2
output:
6
result:
ok 1 number(s): "6"
Test #9:
score: 0
Accepted
time: 0ms
memory: 11868kb
input:
5 1 1 2 3
output:
6
result:
ok 1 number(s): "6"
Test #10:
score: 0
Accepted
time: 0ms
memory: 13852kb
input:
5 2 1 2 3 2 3 4
output:
8
result:
ok 1 number(s): "8"
Test #11:
score: 0
Accepted
time: 0ms
memory: 13932kb
input:
10 1 1 2 3
output:
11
result:
ok 1 number(s): "11"
Test #12:
score: 0
Accepted
time: 2ms
memory: 13836kb
input:
10 1 1 2 2
output:
11
result:
ok 1 number(s): "11"
Test #13:
score: 0
Accepted
time: 0ms
memory: 13840kb
input:
10 2 1 2 3 2 3 4
output:
13
result:
ok 1 number(s): "13"
Test #14:
score: 0
Accepted
time: 2ms
memory: 13856kb
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: 13848kb
input:
10 3 1 2 3 1 8 8 2 3 3
output:
15
result:
wrong answer 1st numbers differ - expected: '13', found: '15'