# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
240669 | robertnovistan | Building 4 (JOI20_building4) | C++14 | 5 ms | 256 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 <cstdio>
#include <bitset>
using namespace std;
const int MAX_BATIMENTS = (1 * 1000);
bitset <MAX_BATIMENTS> Accessibles[MAX_BATIMENTS][2];
int Luxures[MAX_BATIMENTS][2];
int nbBatiments;
void Read() {
scanf("%d", &nbBatiments);
nbBatiments *= 2;
for (int i = 0; i < 2; i ++)
{
for (int j = 0; j < nbBatiments; j ++)
{
scanf("%d", &Luxures[j][i]);
}
}
return;
}
int main() {
Read();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |