제출 #556908

#제출 시각아이디문제언어결과실행 시간메모리
556908ItamarBootfall (IZhO17_bootfall)C++14
0 / 100
0 ms304 KiB
#include <map>
#include <iostream>
using namespace std;
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#define ll long long
#define vi vector<int> 
#define vll vector<ll>
#define pi pair<int,int> 
#define pll pair<ll,ll>


const int siz = 350;
int a[siz];
bool dp[siz * siz][siz];
int uni[siz * siz];
int main()
{
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        int ai;
        cin >> ai;
        a[i] = ai;
    }

    for (int i = 0; i < siz; i++)
        dp[0][i] = 1;
    for (int i = 1; i < siz * siz; i++) {
        for (int j = 0; j < siz; j++) {
            n++;
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...