제출 #1203190

#제출 시각아이디문제언어결과실행 시간메모리
1203190SSKMFCalvinball championship (CEOI15_teams)C++20
0 / 100
129 ms520 KiB
#include <bits/stdc++.h> using namespace std; const int mod(1000007); int sir[10001] , combinari[10001]; int main () { ios :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int lungime; cin >> lungime; for (int indice = 1 ; indice <= lungime ; indice++) { cin >> sir[indice]; } combinari[0] = 1; int rezultat = 1; for (int indice = lungime , ramas = 0 ; indice > 1 ; indice--) { while (ramas < 2 * (lungime - indice) + 1) { ramas++; for (int coloana = ramas ; coloana ; coloana--) { if ((combinari[coloana] += combinari[coloana - 1]) >= mod) { combinari[coloana] -= mod; } } } if (sir[indice] != sir[indice - 1]) { if ((rezultat += combinari[lungime - indice + 1]) >= mod) { rezultat -= mod; } } } cout << rezultat; 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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...