oj.uz

Submission #1062528

# Submission time Handle Problem Language Result Execution time Memory
1062528 2024-08-17T08:16:57 Z kunzaZa183 Amusement Park (CEOI19_amusementpark) C++17
0 / 100
 0 ms 348 KB 
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  int n, m;
  cin >> n >> m;
  vector<int> ht(n);
  vector<pair<int, int>> vpii(m);
  for (auto &a : vpii) {
    cin >> a.first >> a.second;
    a.first--, a.second--;
  }
  iota(ht.begin(), ht.end(), 0);
  int sumc = 0;
  const int mod = 998244353;
  do {
    for (auto a : vpii)
      if ((ht[a.first] > ht[a.second])) {
        sumc++;
        sumc %=mod;
      }
  } while (next_permutation(ht.begin(), ht.end()));
  cout << sumc << "\n";
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -