# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7852 | ainu7 | 행성 탐사 (GA8_planet) | C++98 | 728 ms | 2768 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 <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <set>
#include "planet.h"
using namespace std;
const int trial = 101;
int px[trial], py[trial];
const int max_dup = 6;
int ax[trial][max_dup+2], ay[trial][max_dup+2]; // occ
int bx[trial][trial], by[trial][trial]; // real value
void ainta_init() {
// init. subject to change according to performance.
for (int i=0; i<57; i++)
px[i] = py[i] = i;
// 7-3-2-1
px[57] = 0; py[57] = 57;
px[58] = 1; py[58] = 58;
px[59] = 2; py[59] = 59;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |