Submission #29395314
Source Code Expand
use proconio::{input, marker::Usize1};
fn main() {
input! {
n: usize,
m: usize,
ab: [(Usize1, Usize1); m],
};
let mut count = vec![0; n];
for (a, b) in ab {
match a.cmp(&b) {
std::cmp::Ordering::Less => count[b] += 1,
std::cmp::Ordering::Equal => {}
std::cmp::Ordering::Greater => count[a] += 1,
}
}
let ans = count.into_iter().filter(|c| c == &1).count();
println!("{}", ans);
}
Submission Info
| Submission Time | |
|---|---|
| Task | 045 - Easy Graph Problem(★2) |
| User | bouzuya |
| Language | Rust (1.42.0) |
| Score | 2 |
| Code Size | 485 Byte |
| Status | AC |
| Exec Time | 18 ms |
| Memory | 5200 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 2 / 2 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt |
| All | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 10_random_small_00.txt, 10_random_small_01.txt, 10_random_small_02.txt, 10_random_small_03.txt, 10_random_small_04.txt, 10_random_small_05.txt, 10_random_small_06.txt, 10_random_small_07.txt, 11_random_large_00.txt, 11_random_large_01.txt, 11_random_large_02.txt, 11_random_large_03.txt, 11_random_large_04.txt, 11_random_large_05.txt, 11_random_large_06.txt, 11_random_large_07.txt, 20_random_max_00.txt, 20_random_max_01.txt, 20_random_max_02.txt, 20_random_max_03.txt, 20_random_max_04.txt, 80_random_tree_00.txt, 80_random_tree_01.txt, 90_random_uni_00.txt, 90_random_uni_01.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 00_sample_00.txt | AC | 7 ms | 2048 KiB |
| 00_sample_01.txt | AC | 1 ms | 2048 KiB |
| 00_sample_02.txt | AC | 3 ms | 2052 KiB |
| 10_random_small_00.txt | AC | 3 ms | 2048 KiB |
| 10_random_small_01.txt | AC | 1 ms | 2128 KiB |
| 10_random_small_02.txt | AC | 1 ms | 2048 KiB |
| 10_random_small_03.txt | AC | 2 ms | 2052 KiB |
| 10_random_small_04.txt | AC | 1 ms | 2120 KiB |
| 10_random_small_05.txt | AC | 1 ms | 2132 KiB |
| 10_random_small_06.txt | AC | 1 ms | 2112 KiB |
| 10_random_small_07.txt | AC | 1 ms | 2120 KiB |
| 11_random_large_00.txt | AC | 3 ms | 2308 KiB |
| 11_random_large_01.txt | AC | 11 ms | 3812 KiB |
| 11_random_large_02.txt | AC | 9 ms | 2920 KiB |
| 11_random_large_03.txt | AC | 5 ms | 2540 KiB |
| 11_random_large_04.txt | AC | 3 ms | 2336 KiB |
| 11_random_large_05.txt | AC | 2 ms | 2300 KiB |
| 11_random_large_06.txt | AC | 4 ms | 2588 KiB |
| 11_random_large_07.txt | AC | 8 ms | 3460 KiB |
| 20_random_max_00.txt | AC | 18 ms | 5156 KiB |
| 20_random_max_01.txt | AC | 14 ms | 5112 KiB |
| 20_random_max_02.txt | AC | 14 ms | 5124 KiB |
| 20_random_max_03.txt | AC | 14 ms | 4996 KiB |
| 20_random_max_04.txt | AC | 16 ms | 5008 KiB |
| 80_random_tree_00.txt | AC | 15 ms | 5024 KiB |
| 80_random_tree_01.txt | AC | 16 ms | 5128 KiB |
| 90_random_uni_00.txt | AC | 15 ms | 4620 KiB |
| 90_random_uni_01.txt | AC | 15 ms | 5200 KiB |