結果

問題 No.584 赤、緑、青の色塗り
ユーザー manuginomanugino
提出日時 2017-10-31 16:15:38
言語 C++11
(gcc 11.4.0)
結果
TLE  
実行時間 -
コード長 6,519 bytes
コンパイル時間 777 ms
コンパイル使用メモリ 85,980 KB
実行使用メモリ 10,624 KB
最終ジャッジ日時 2024-11-22 10:47:27
合計ジャッジ時間 28,561 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
8,320 KB
testcase_01 AC 2 ms
8,320 KB
testcase_02 AC 2 ms
10,496 KB
testcase_03 AC 2 ms
8,320 KB
testcase_04 AC 2 ms
10,496 KB
testcase_05 TLE -
testcase_06 AC 2 ms
10,496 KB
testcase_07 AC 2 ms
8,448 KB
testcase_08 AC 1 ms
8,576 KB
testcase_09 AC 2 ms
8,704 KB
testcase_10 AC 2 ms
8,576 KB
testcase_11 AC 2 ms
8,576 KB
testcase_12 TLE -
testcase_13 TLE -
testcase_14 TLE -
testcase_15 TLE -
testcase_16 TLE -
testcase_17 TLE -
testcase_18 TLE -
testcase_19 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// [Tips]
// XCodeでのEOF入力はCtrl+D
// ¥はAlt+\
// ansは結構INTの範囲2,147,483,647を超えることがあるのでlong long使っておいたほうが良い
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////



////////////////////////////////////////
//
////////////////////////////////////////

//#define debug //*******************************************************************************************************************************************
#ifdef debug
#include <chrono>
#endif

#include <iostream>
#include <algorithm> // next_permutation
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstring> //memcpy
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric> //accumulate
//#include <map>
//#include <unordered_map> //hash func.
#include <fstream> //ifstream, ofstream
#include <iterator> //insert_iterator::inserter
#include <set>


//#define NDEBUG //If NDEBUG is defined before #include <cassert>, assert will be ignored. You had better define NDEBUG when u submit the code.
#include <cassert> //assert

using namespace std;


#define dout cout
//If u wanna output to a text file instead of standard output, plz define OUTPUTFILE.
//#define OUTPUTFILE "output.txt" //************************************************************
#ifdef OUTPUTFILE
#define dout outputfile
ofstream outputfile(OUTPUTFILE);
#define OutputFilePath "/Users/Nag/Documents/Prgm/Test/DerivedData/Test/Build/Products/Debug/output.txt"
#endif


#define din cin
//If u wanna input from a text file instead of standard input, plz define INPUTFROMTEXTFILEを.
//#define INPUTFILE "input.txt" //**************************************************************
#ifdef INPUTFILE
#define din inputfile
ifstream inputfile(INPUTFILE);
#endif

#define scand(A) scanf("%d", &(A))
#define scans(A) scanf("%s", (A))
#define printd(A) printf("%d\n", (A))
#define prints(A) printf("%s\n", (A))
#define disp(A) dout << #A << " = " << setw(3) << (A) << endl
#define disP(A) dout << setw(3) << (A) << " "
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define show(A,s,g) dout << #A << " = "; rep(j, (s), (g)) {disP(A[j]);} dout << endl
#define showi(A,s,g) dout << #A << " = "; rep(j, (s), (g)) {disP(j);} dout << endl


#define sign(x) ((x)>0)-((x)<0) //x<0: -1, x=0: 0, x>0: +1
#define p(i) ((i)/2)
#define l(i) ((i)*2)
#define r(i) ((i)*2+1)
#define sibling(i) (i^1) //the other sibling of i (ex. 16^1 = 17, 17^1 = 16)
#define isRightChild(i) (i&1) // ex. 16&1 = 0, 17&1 = 1
#define isLeftChild(i) (!(i&1)) // ex. 16&1 = 1, 17&1 = 0

int dx[] = {1, 0, -1,  0};
int dy[] = {0, 1,  0, -1};

typedef pair<int,int> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef long long ll;
typedef unsigned long long ull;

const int INF = (1LL<<31)-1;
const ll INF_LL = (ll)9e18-1LL; //Be careful for overflow.
const ull INF_ULL = (ull)1e19-1ULL;
const int NONE = -1;
const ll MOD = (ll)1e9+7; //大きい素数の代表といえばこの人、10億7さん

const int N_MAX = 3010; //num of vertex or element
const int M_MAX = 124760; //num of edge
const int DATA_MAX = 1010;

#define WHITE 0
#define RED 1
#define GREEN 2
#define BLUE 3


int N;
int R, G, B;

int ans = 0;

void init() {
}



int solve(int i, bool prevprevIsColored, int prevColor, int r, int g, int b) {
    
#ifdef debug
    dout << "--------- solve( i=" << i << ", pp=" << prevprevIsColored << ", pC="<< prevColor << ", R=" << r<< ", G=" << g<< ", B=" << b << " )\n";
#endif
    
    //failure
    if(r<0 or g<0 or b<0) return 0;
    
    //end condition
    if(i==N) {
        if(r==0 and g==0 and b==0) return 1; //all cells have been successfully colored!
        else return 0;
    }
        
        
    int result = 0;
    
    if(prevprevIsColored and prevColor) { //colored, colored, i
        (result += solve(i+1, true, WHITE, r, g, b) ) %= MOD;
    }
    
    else if( prevColor==WHITE ) { //colored, white, i  or  white, white, i
            (result += solve(i+1, false, WHITE, r, g, b) ) %= MOD;
            (result += solve(i+1, false, RED, r-1, g, b) ) %= MOD;
            (result += solve(i+1, false, GREEN, r, g-1, b) ) %= MOD;
            (result += solve(i+1, false, BLUE, r, g, b-1) ) %= MOD;
    }
    
    else { //white, colored, i
        rep(k,0,4) {
            
            if(k==prevColor) continue;
            
            (result += solve(i+1, true, k, r-(k==RED), g-(k==GREEN), b-(k==BLUE)) ) %= MOD;
        }
    }
    
    
    
#ifdef debug
    dout << "result of solve( i=" << i << ", pp=" << prevprevIsColored << ", pC="<< prevColor << ", R=" << r<< ", G=" << g<< ", B=" << b << " )\n";
    disp(result);
    dout << "===\n";
#endif
    return result;
}







void display() {
#ifdef debug
    dout << "----\n";
    
    
#endif
}



int main() {
    
    //cin, coutの高速化  ＊注意：cinを使うなら全部cinで、scanfを使うなら全部scanfで統一するように！
    cin.tie(0); //cinとcoutの同期を切る
    ios::sync_with_stdio(false); //iostreamとstdioの同期を切る
    
    //read input data
//    scand(N);
    
    din >> N >> R >> G >> B;
    
    
    
    init();
    display();

    

    
    
    //------------------------------------------------------------------------------------------
#ifdef debug
    //start timer
    auto startTime = chrono::system_clock::now();
#endif
    //------------------------------------------------------------------------------------------
    
    
    ans = solve(0, 0, 0, R, G, B);
    
    
    
#ifdef debug
    dout << "=== OUTPUT ===\n";
#endif
    
    dout << ans << endl;
    
    
    
    
    
    
    //------------------------------------------------------------------------------------------
#ifdef debug
    //stop timer
    auto endTime = chrono::system_clock::now();
    auto dur = endTime - startTime;
    auto msec = chrono::duration_cast<chrono::milliseconds>(dur).count();
    dout << fixed << setprecision(4) << (double)msec/1000 << " sec \n";
#endif
    //------------------------------------------------------------------------------------------
    
#ifdef INPUTFILE
    inputfile.close();
#endif
    
#ifdef OUTPUTFILE
    outputfile.close();
    cout << "\"" << OutputFilePath << "\"" << endl;
#endif
    
    return 0;
}
0