# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1128998 | nhanhoang510 | Jobs (BOI24_jobs) | C++20 | 95 ms | 26972 KiB |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
const int maxn = 3 * 1e5 + 7;
const int LOG = 20;
const long long MOD = (long long)(1e9) + 7;
const long long base = 311;
const int ALP_BET = 26;
typedef pair<int, int> ii;
typedef pair<int, long long> il;
typedef pair<long long, int> li;
typedef pair<long long, long long> ll;
int n, m;
long long a[maxn], s;
int p[maxn]; vector<int> adj[maxn];
int root[maxn];
namespace BUFFALO{
const int maxN = 10 + 7;
bool ok[maxN];
int arr[maxN];
long long ans;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |