193262025-12-04 20:41:14KristófNegáló rendezés (55 pont)cpp17Wrong answer 0/5532ms508 KiB
#include <iostream>
using namespace std;

const int mod = 1000000007;

int main() {
    int n;
    cin >> n;
    int x;
    int elozo=-1;
    int ans = 1;
    for(int i = 0; i < n; i++)
        {
        cin >> x;
        if(x == elozo)
            {
            ans = (ans+ans-1)%mod;
            }
        else
            {
            ans = (ans * 2) % mod;
            }
        }
    cout << ans;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/55
1Wrong answer0/02ms500 KiB
2Wrong answer0/032ms496 KiB
3Wrong answer0/22ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms508 KiB
7Wrong answer0/31ms356 KiB
8Wrong answer0/21ms328 KiB
9Wrong answer0/31ms508 KiB
10Wrong answer0/328ms400 KiB
11Wrong answer0/332ms396 KiB
12Wrong answer0/332ms400 KiB
13Wrong answer0/330ms400 KiB
14Wrong answer0/332ms396 KiB
15Wrong answer0/332ms400 KiB
16Wrong answer0/332ms396 KiB
17Wrong answer0/330ms396 KiB
18Wrong answer0/332ms400 KiB
19Wrong answer0/332ms400 KiB
20Wrong answer0/332ms400 KiB
21Wrong answer0/329ms400 KiB
22Wrong answer0/332ms396 KiB