# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
480158 | pure_mem | Nautilus (BOI19_nautilus) | C++14 | 205 ms | 812 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 <iostream>
#include <bitset>
#include <cmath>
#include <cassert>
#define X first
#define Y second
#define ll long long
#define MP make_pair
using namespace std;
const int N = 501, INF = 1e8;
const ll mod = 1e9 + 7;
int n, m, q;
string Q;
bitset<N*N> dp, res, mask;
void prints() {
for(int i = 1;i <= n;i++) {
for(int j = 1;j <= m;j++) {
cout << dp[i * N + j];
}
cout << "\n";
}
cout << "\n";
}
int main() {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |