# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
474115 | 2021-09-17T00:02:36 Z | Cross_Ratio | 비스킷 담기 (IOI20_biscuits) | C++14 | 1000 ms | 348 KB |
//#include "biscuits.h" #include <bits/stdc++.h> using namespace std; long long cnt = 0; long long int X; long long int backtrack(int N, vector<long long> A) { long long int ans = 0; vector<long long> A1 = A; if(A1[N] >= X) { A1[N] -= X; if(N == A1.size() - 1) A1.push_back(A1[N]/2); else A1[N+1] += A1[N]/2; ans += backtrack(N+1,A1); } if(N == A.size() - 1) { if(A[N] < X) return 1; A.push_back(A[N]/2); } else A[N+1] += A[N] / 2; ans += backtrack(N+1,A); //cout << N <<" : " << ans << '\n'; return ans; } long long count_tastiness(long long x, vector<long long> a) { X = x; return backtrack(0,a); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 26 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Correct | 39 ms | 204 KB | Output is correct |
5 | Correct | 10 ms | 296 KB | Output is correct |
6 | Correct | 131 ms | 292 KB | Output is correct |
7 | Correct | 6 ms | 204 KB | Output is correct |
8 | Correct | 104 ms | 272 KB | Output is correct |
9 | Correct | 17 ms | 296 KB | Output is correct |
10 | Correct | 1 ms | 204 KB | Output is correct |
11 | Correct | 1 ms | 204 KB | Output is correct |
12 | Correct | 750 ms | 336 KB | Output is correct |
13 | Correct | 328 ms | 340 KB | Output is correct |
14 | Correct | 30 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 25 ms | 284 KB | Output is correct |
2 | Execution timed out | 1082 ms | 276 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1073 ms | 204 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1092 ms | 332 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 26 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Correct | 39 ms | 204 KB | Output is correct |
5 | Correct | 10 ms | 296 KB | Output is correct |
6 | Correct | 131 ms | 292 KB | Output is correct |
7 | Correct | 6 ms | 204 KB | Output is correct |
8 | Correct | 104 ms | 272 KB | Output is correct |
9 | Correct | 17 ms | 296 KB | Output is correct |
10 | Correct | 1 ms | 204 KB | Output is correct |
11 | Correct | 1 ms | 204 KB | Output is correct |
12 | Correct | 750 ms | 336 KB | Output is correct |
13 | Correct | 328 ms | 340 KB | Output is correct |
14 | Correct | 30 ms | 348 KB | Output is correct |
15 | Correct | 25 ms | 284 KB | Output is correct |
16 | Execution timed out | 1082 ms | 276 KB | Time limit exceeded |
17 | Halted | 0 ms | 0 KB | - |