제출 #861827

#제출 시각아이디문제언어결과실행 시간메모리
861827sleepntsheepCollecting Stamps 3 (JOI20_ho_t3)C++17
0 / 100
0 ms344 KiB
#include <cstdio> #include <cstring> #include <cassert> #include <string> #include <deque> #include <vector> #include <map> #include <queue> #include <algorithm> #include <iostream> #include <utility> using namespace std; using ll = long long; using ld = long double; #define N 202 #define ALL(x) x.begin(), x.end() int n, l, x[N], t[N], dp[N][N][N][2]; int main() { cin.tie(0)->sync_with_stdio(0); cin >> n >> l; for (int i = 1; i <= n; ++i) cin >> x[i]; for (int i = 1; i <= n; ++i) cin >> t[i]; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...