# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
949904 | Dec0Dedd | Boarding Passes (BOI22_passes) | C++14 | 232 ms | 96952 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, int> pii;
const int N = 1e5+100;
const ll INF = 1e18;
const int G = 15;
vector<int> idx[N];
ll n, cross[G][G][N];
string s;
ll dist[1<<G];
ll nc2(ll x) {
if (x < 2) return 0;
return x*(x-1)/2;
}
ll calc(int msk, int u, int k) {
ll res=0;
for (int i=0; i<G; ++i) {
if (!(msk&(1<<i))) continue;
res+=2*cross[u][i][k];
} int sz=idx[u].size();
# | 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... |