53822023-04-27 18:59:30botondliskaSzínes szobák (50 pont)cpp17Time limit exceeded 10/50388ms6556 KiB
#include <iostream>
#define MAXN 100000

using namespace std;

int n,k,m;
int szoba[MAXN];
int fo[MAXN];
int szin[MAXN];
int lepes[MAXN];

int main()
{
cin>>n>>k>>m;

for(int i=1;i<n+1;++i)fo[i]=1;
for(int i=1;i<n+1;++i)cin>>szoba[i];
for(int i=0;i<m;++i)cin>>szin[i]>>lepes[i];

for(int i=0;i<m;++i)
{
    for(int j=1;j<n+1;++j)
    {
        if(szin[i]==szoba[j] && lepes[i]==1)
        {
            fo[j+1]+=fo[j];
            fo[j]=0;
        }
        if(szin[i]==szoba[j] && lepes[i]==-1)
        {
            fo[j-1]+=fo[j];
            fo[j]=0;
        }
    }
}

cout<<fo[0]+fo[n+1];


    return 0;
}
SubtaskSumTestVerdictTimeMemory
base10/50
1Accepted0/03ms1900 KiB
2Time limit exceeded0/0363ms3804 KiB
3Accepted1/14ms2584 KiB
4Accepted1/14ms2796 KiB
5Accepted1/14ms2980 KiB
6Accepted1/14ms2940 KiB
7Accepted1/14ms2944 KiB
8Accepted1/14ms3084 KiB
9Accepted1/14ms3292 KiB
10Accepted1/110ms3388 KiB
11Wrong answer0/14ms3560 KiB
12Accepted1/114ms3792 KiB
13Wrong answer0/1214ms4212 KiB
14Accepted1/175ms4272 KiB
15Wrong answer0/193ms4248 KiB
16Time limit exceeded0/1345ms3596 KiB
17Time limit exceeded0/1363ms3488 KiB
18Time limit exceeded0/1351ms3496 KiB
19Time limit exceeded0/1342ms4228 KiB
20Wrong answer0/1151ms5860 KiB
21Time limit exceeded0/1349ms4220 KiB
22Time limit exceeded0/1307ms5804 KiB
23Time limit exceeded0/1375ms4484 KiB
24Wrong answer0/1272ms6264 KiB
25Time limit exceeded0/1375ms4872 KiB
26Time limit exceeded0/1379ms4768 KiB
27Time limit exceeded0/3388ms4872 KiB
28Wrong answer0/328ms6468 KiB
29Wrong answer0/328ms6556 KiB
30Wrong answer0/328ms6540 KiB
31Time limit exceeded0/3361ms5832 KiB
32Time limit exceeded0/3360ms5280 KiB
33Time limit exceeded0/4382ms5360 KiB
34Time limit exceeded0/4354ms5588 KiB