제출 #1203195

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1203195		SSKMF	Calvinball championship (CEOI15_teams)	C++20	0 / 100	97 ms	400 KiB

teams

#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 = min(ramas , lungime) ; coloana ; coloana--) {
                if ((combinari[coloana] += combinari[coloana - 1]) >= mod)
                    { combinari[coloana] -= mod; }
            }
        }

        if (sir[indice] != sir[indice - 1]) {
            if ((rezultat += combinari[lungime - indice]) >= mod)
                { rezultat -= mod; }
        }
    }

    cout << rezultat;
    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10