# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
278093 | Retro3014 | Toys (CEOI18_toy) | C++17 | 3162 ms | 17008 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 <algorithm>
#include <vector>
#include <stdio.h>
using namespace std;
#define INF 1000000001
typedef long long ll;
int N;
vector<int> d;
vector<int> ans;
int multi(int a, int b){
ll x = 1;
while(b--){
x*=(ll)a;
x = min(x, (ll)INF);
}
return min(x, (ll)INF);
}
int answer;
int now;
void dfs(int x, int y){
if(x==29){
if(now==1){
ans.push_back(answer);
}
Compilation message (stderr)
# | 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... |