Submission #155311
Source Code Expand
#include <iostream> #include <iomanip> #include <sstream> #include <vector> #include <string> #include <set> #include <map> #include <stack> #include <queue> #include <algorithm> #include <functional> #include <iterator> #include <limits> #include <numeric> #include <utility> #include <cmath> using namespace std; using LL = long long; using ULL = unsigned long long; using VI = vector<int>; using VVI = vector<VI>; using VS = vector<string>; using SS = stringstream; using PII = pair<int,int>; using VPII = vector< pair<int,int> >; template < typename T = int > using VT = vector<T>; template < typename T = int > using VVT = VT< VT<T> >; template < typename T = int > using LIM = numeric_limits<T>; template < typename T > inline T fromString( const string &s ){ T res; istringstream iss( s ); iss >> res; return res; }; template < typename T > inline string toString( const T &a ){ ostringstream oss; oss << a; return oss.str(); }; #define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); ++i ) #define FOR( e, c ) for ( auto &e : c ) #define ALL( c ) (c).begin(), (c).end() #define AALL( a, t ) (t*)a, (t*)a + sizeof( a ) / sizeof( t ) #define DRANGE( c, p ) (c).begin(), (c).begin() + p, (c).end() #define PB( n ) push_back( n ) #define MP( a, b ) make_pair( ( a ), ( b ) ) #define EXIST( c, e ) ( (c).find( e ) != (c).end() ) #define fst first #define snd second #define DUMP( x ) cerr << #x << " = " << ( x ) << endl constexpr int MOD = 10007; int main() { cin.tie( 0 ); ios::sync_with_stdio( false ); int n; cin >> n; VI dp( n + 1 ); dp[3] = 1; REP( i, 4, n + 1 ) { REP( j, -3, 0 ) { ( dp[i] += dp[ i + j ] ) %= MOD; } } cout << dp[n] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - トリボナッチ数列 |
User | torus711 |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 1781 Byte |
Status | AC |
Exec Time | 44 ms |
Memory | 4760 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 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 | 24 ms | 920 KB |
sample_02.txt | AC | 23 ms | 788 KB |
sample_03.txt | AC | 23 ms | 1304 KB |
test_1.txt | AC | 22 ms | 916 KB |
test_1000000.txt | AC | 41 ms | 4652 KB |
test_1002.txt | AC | 21 ms | 924 KB |
test_104.txt | AC | 21 ms | 920 KB |
test_107843.txt | AC | 23 ms | 1304 KB |
test_10980.txt | AC | 22 ms | 920 KB |
test_1212.txt | AC | 23 ms | 848 KB |
test_1238.txt | AC | 22 ms | 924 KB |
test_13194.txt | AC | 22 ms | 920 KB |
test_14.txt | AC | 20 ms | 924 KB |
test_16.txt | AC | 22 ms | 920 KB |
test_2.txt | AC | 21 ms | 808 KB |
test_210782.txt | AC | 24 ms | 1572 KB |
test_21694.txt | AC | 22 ms | 920 KB |
test_243.txt | AC | 21 ms | 924 KB |
test_24916.txt | AC | 22 ms | 920 KB |
test_278.txt | AC | 21 ms | 924 KB |
test_3.txt | AC | 21 ms | 920 KB |
test_31.txt | AC | 22 ms | 924 KB |
test_32.txt | AC | 22 ms | 916 KB |
test_42.txt | AC | 21 ms | 920 KB |
test_5555.txt | AC | 21 ms | 920 KB |
test_567914.txt | AC | 32 ms | 3092 KB |
test_61868.txt | AC | 20 ms | 1172 KB |
test_765671.txt | AC | 37 ms | 3736 KB |
test_8195.txt | AC | 21 ms | 920 KB |
test_8353.txt | AC | 22 ms | 924 KB |
test_9.txt | AC | 22 ms | 920 KB |
test_9625.txt | AC | 21 ms | 920 KB |
test_97.txt | AC | 22 ms | 924 KB |
test_998.txt | AC | 22 ms | 924 KB |
test_999998.txt | AC | 42 ms | 4652 KB |
test_999999.txt | AC | 44 ms | 4760 KB |