제출 #48896

#제출 시각아이디문제언어결과실행 시간메모리
48896updown1printf 함수 1 (BSC_0_1)C++17
0 / 100
1 ms256 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define For(i, a, b) for(int i=a; i<b; i++) #define ffi For(i, 0, N) #define ffj For(j, 0, K+1) #define ffa ffi ffj #define s <<" "<< #define w cout #define e "\n" #define pb push_back #define mp make_pair #define a first #define b second //#define int ll //500,000,000 operations const int MAXN = 100000, INF = 100000000; //Global Variables #define maxn 100111 #define maxk 211 typedef long long ll; typedef long double ld; typedef pair<int, int> pii; ll k[maxn], n[maxn]; int ind[maxn]; int best_ind, top, bot; ll dp[maxn][2], pre[maxn], arr[maxn]; int from[maxn][maxk]; int main() { //ifstream cin("test.in"); ios_base::sync_with_stdio(0); cin.tie(0); w<< "Hello World!"<<e; }
#Verdict Execution timeMemoryGrader output
Fetching results...