Submission #1517458
Source Code Expand
#include <map> #include <set> #include <list> #include <cmath> #include <deque> #include <queue> #include <stack> #include <cstdio> #include <string> #include <vector> #include <complex> #include <cstdlib> #include <cstring> #include <numeric> #include <utility> #include <iostream> #include <algorithm> #include <functional> #include <unordered_map> #include <unordered_set> using namespace std; #define ll long long #define ull unsigned long long #define INF (1 << 30) #define LLINF (1LL << 62) #define MOD7 1000000007 #define MOD9 1000000009 #define eps 1e-9 #define P pair<int, int> #define pii pair<int, int> #define pll pair<ll, ll> #define pul pair<ull, ull> #define all(a) (a).begin(), (a).end() #define FOR(i,a,b) for (int i=(a);i<(b);++i) #define RFOR(i,a,b) for (int i=(b)-1;i>=(a);--i) #define REP(i,n) for (int i=0;i<(n);++i) #define RREP(i,n) for (int i=(n)-1;i>=0;--i) void YES() { cout << "YES\n"; } void NO() { cout << "NO\n"; } void Yes() { cout << "Yes\n"; } void No() { cout << "No\n"; } void yes() { cout << "yes" << endl; } void no() { cout << "no" << endl; } int a[1000001]; int tri(int n) { if (a[n] != -1) return a[n]; a[n] = (tri(n - 1) + tri(n - 2) + tri(n - 3)) % 10007; return a[n]; } int main() { int n; cin >> n; fill(a, a + n + 1, -1); a[1] = a[2] = 0; a[3] = 1; cout << tri(n) << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - トリボナッチ数列 |
User | temple |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1412 Byte |
Status | AC |
Exec Time | 31 ms |
Memory | 35456 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | sample_01.txt, sample_02.txt, sample_03.txt, test_1.txt, test_1000000.txt, test_1002.txt, test_104.txt, test_107843.txt, test_10980.txt, test_1212.txt, test_1238.txt, test_13194.txt, test_14.txt, test_16.txt, test_2.txt, test_210782.txt, test_21694.txt, test_243.txt, test_24916.txt, test_278.txt, test_3.txt, test_31.txt, test_32.txt, test_42.txt, test_5555.txt, test_567914.txt, test_61868.txt, test_765671.txt, test_8195.txt, test_8353.txt, test_9.txt, test_9625.txt, test_97.txt, test_998.txt, test_999998.txt, test_999999.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 4 ms | 3712 KB |
test_1.txt | AC | 1 ms | 256 KB |
test_1000000.txt | AC | 31 ms | 35456 KB |
test_1002.txt | AC | 1 ms | 256 KB |
test_104.txt | AC | 1 ms | 256 KB |
test_107843.txt | AC | 4 ms | 4096 KB |
test_10980.txt | AC | 1 ms | 640 KB |
test_1212.txt | AC | 1 ms | 256 KB |
test_1238.txt | AC | 1 ms | 256 KB |
test_13194.txt | AC | 1 ms | 768 KB |
test_14.txt | AC | 1 ms | 256 KB |
test_16.txt | AC | 1 ms | 256 KB |
test_2.txt | AC | 1 ms | 256 KB |
test_210782.txt | AC | 7 ms | 7680 KB |
test_21694.txt | AC | 2 ms | 1024 KB |
test_243.txt | AC | 1 ms | 256 KB |
test_24916.txt | AC | 2 ms | 1152 KB |
test_278.txt | AC | 1 ms | 256 KB |
test_3.txt | AC | 1 ms | 256 KB |
test_31.txt | AC | 1 ms | 256 KB |
test_32.txt | AC | 1 ms | 256 KB |
test_42.txt | AC | 1 ms | 256 KB |
test_5555.txt | AC | 1 ms | 384 KB |
test_567914.txt | AC | 18 ms | 20224 KB |
test_61868.txt | AC | 3 ms | 2432 KB |
test_765671.txt | AC | 24 ms | 27136 KB |
test_8195.txt | AC | 1 ms | 512 KB |
test_8353.txt | AC | 1 ms | 512 KB |
test_9.txt | AC | 1 ms | 256 KB |
test_9625.txt | AC | 1 ms | 512 KB |
test_97.txt | AC | 1 ms | 256 KB |
test_998.txt | AC | 1 ms | 256 KB |
test_999998.txt | AC | 31 ms | 35456 KB |
test_999999.txt | AC | 31 ms | 35456 KB |