| Task: | Kortit II | 
| Sender: | Saksunoob | 
| Submission time: | 2024-10-31 19:24:35 +0200 | 
| Language: | Rust (2021) | 
| Status: | READY | 
| Result: | 0 | 
| group | verdict | score | 
|---|---|---|
| #1 | WRONG ANSWER | 0 | 
| #2 | WRONG ANSWER | 0 | 
| #3 | WRONG ANSWER | 0 | 
| #4 | WRONG ANSWER | 0 | 
| #5 | WRONG ANSWER | 0 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.00 s | 1, 2, 3, 4, 5 | details | 
| #2 | WRONG ANSWER | 0.20 s | 2, 3, 4, 5 | details | 
| #3 | TIME LIMIT EXCEEDED | -- | 3, 4, 5 | details | 
| #4 | TIME LIMIT EXCEEDED | -- | 4, 5 | details | 
| #5 | TIME LIMIT EXCEEDED | -- | 5 | details | 
| #6 | TIME LIMIT EXCEEDED | -- | 5 | details | 
Code
use std::{collections::HashSet, io};
fn main() {
    let mut t_str = String::new();
    io::stdin().read_line(&mut t_str).unwrap();
    t_str = t_str.trim().to_string();
    let t: usize = t_str.parse().unwrap();
    let mut tests: Vec<[usize; 3]> = Vec::with_capacity(t);
    for test in 0..t {
        let mut test_str = String::new();
        io::stdin().read_line(&mut test_str).unwrap();
        test_str = test_str.trim().to_string();
        tests.push([0, 0, 0]);
        for (i, num) in test_str.split(' ').enumerate() {
            tests[test][i] = num.parse().unwrap();
        }
    }
    for test in tests {
        let mut amount = 0;
        let evens = test[0]-test[1]-test[2];
        let options = (1..=test[0]).collect();
        count(&options, test[0], &mut amount, evens, test[2], test[1]);
        let result = amount*factorial(test[0])%1000000007;
        println!("{}", result);
    }
}
pub fn factorial(num: usize) -> usize {
    let mut result = 1;
    for i in 2..=num {
        result *= i;
        result %= 1000000007;
    }
    return result;
}
fn count(options: &HashSet<usize>, opponent: usize, amount: &mut usize, evens: usize, losses: usize, wins: usize) {
    if opponent == 1 {
        assert_eq!(options.len(), opponent);
        if evens == 1 && options.contains(&1) {
            *amount += 1;
        }
        else if wins == 1 && !options.contains(&1) {
            *amount += 1;
        }
        return;
    }
    
    for c in options.iter() {
        if losses > 0 && *c < opponent {
            let mut copy = options.clone();
            copy.remove(c);
            count(©, opponent-1, amount, evens, losses-1, wins);
        }
        else if wins > 0 && *c > opponent {
            let mut copy = options.clone();
            copy.remove(c);
            count(©, opponent-1, amount, evens, losses, wins-1);
        }
        else if evens > 0 && *c == opponent {
            let mut copy = options.clone();
            copy.remove(c);
            count(©, opponent-1, amount, evens-1, losses, wins);
        }
    }
}
Test details
Test 1
Group: 1, 2, 3, 4, 5
Verdict: WRONG ANSWER
| input | 
|---|
| 54 4 4 0 3 1 3 3 2 2 4 0 4 ...  | 
| correct output | 
|---|
| 0 0 0 0 0 ...  | 
| user output | 
|---|
| 0 18 6 0 6 ...  | 
Test 2
Group: 2, 3, 4, 5
Verdict: WRONG ANSWER
| input | 
|---|
| 284 6 1 0 5 0 2 7 1 5 7 7 5 ...  | 
| correct output | 
|---|
| 0 0 35280 0 36720 ...  | 
| user output | 
|---|
| 0 0 35280 0 36720 ...  | 
Test 3
Group: 3, 4, 5
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 841 19 3 12 19 19 13 19 7 13 20 11 15 ...  | 
| correct output | 
|---|
| 40291066 0 0 0 0 ...  | 
| user output | 
|---|
| (empty) | 
Test 4
Group: 4, 5
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 15 12 6 7 1 6 44 4 26 6 6 5 ...  | 
| correct output | 
|---|
| 0 5040 494558320 0 340694548 ...  | 
| user output | 
|---|
| (empty) | 
Test 5
Group: 5
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 892 638 599 966 429 655 1353 576 1140 1403 381 910 ...  | 
| correct output | 
|---|
| 0 0 0 249098285 0 ...  | 
| user output | 
|---|
| (empty) | 
Test 6
Group: 5
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 2000 1107 508 2000 1372 249 2000 588 65 2000 1739 78 ...  | 
| correct output | 
|---|
| 750840601 678722180 744501884 159164549 868115056 ...  | 
| user output | 
|---|
| (empty) | 
