oj.uz

Submission #6334

# Submission time Handle Problem Language Result Execution time Memory
6334 2014-06-28T08:17:58 Z jhs7jhs 돌 옮기기 (GA7_stone) C++
56 / 100
 1500 ms 5384 KB 
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

long long r;
int n;
char s[400010]={0},p[800020]={0};
long long x[400010]={0};
int main()
{
    int i;
    int first,last;
    //long long sum = 0;
    char *temp;
    char t[2]={0};
    scanf("%lld%d",&r,&n);
    n *= 2;
    for(i=0;i<n;i++){
        scanf("%lld%s",&x[i],t);
        s[i] = t[0];
    }
    for(i=0;i<n;i++){
        if(s[i] == 'W') p[i] = 'B';
        else p[i] = 'W';
    }
    for(i=0;i<n;i++) p[i+n] = p[i];
    temp = strstr(p,s);
    if(temp == NULL){
        printf("-1\n");
        return 0;
    }
    first = (int)(temp - p);
    reverse(s,s+n);
    reverse(p,p+2*n);
    temp = strstr(p,s);
    last = (int)(temp-p);
    if(first<=last) printf("%lld\n",r*(long long)first);
    else printf("%lld\n",r*(long long)last);
    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5384 KB Output is correct
2 Correct 0 ms 5384 KB Output is correct
3 Correct 0 ms 5384 KB Output is correct
4 Correct 0 ms 5384 KB Output is correct
5 Correct 0 ms 5384 KB Output is correct
6 Correct 0 ms 5384 KB Output is correct
7 Correct 0 ms 5384 KB Output is correct
8 Correct 0 ms 5384 KB Output is correct
9 Correct 0 ms 5384 KB Output is correct
10 Correct 0 ms 5384 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5384 KB Output is correct
2 Correct 0 ms 5384 KB Output is correct
3 Correct 0 ms 5384 KB Output is correct
4 Correct 0 ms 5384 KB Output is correct
5 Correct 0 ms 5384 KB Output is correct
6 Correct 0 ms 5384 KB Output is correct
7 Correct 0 ms 5384 KB Output is correct
8 Correct 0 ms 5384 KB Output is correct
9 Correct 0 ms 5384 KB Output is correct
10 Correct 0 ms 5384 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5384 KB Output is correct
2 Correct 0 ms 5384 KB Output is correct
3 Correct 0 ms 5384 KB Output is correct
4 Correct 0 ms 5384 KB Output is correct
5 Correct 0 ms 5384 KB Output is correct
6 Correct 0 ms 5384 KB Output is correct
7 Correct 0 ms 5384 KB Output is correct
8 Correct 0 ms 5384 KB Output is correct
9 Correct 0 ms 5384 KB Output is correct
10 Correct 0 ms 5384 KB Output is correct
11 Correct 0 ms 5384 KB Output is correct
12 Correct 0 ms 5384 KB Output is correct
13 Correct 0 ms 5384 KB Output is correct
14 Correct 0 ms 5384 KB Output is correct
15 Correct 0 ms 5384 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5384 KB Output is correct
2 Correct 0 ms 5384 KB Output is correct
3 Correct 0 ms 5384 KB Output is correct
4 Correct 0 ms 5384 KB Output is correct
5 Correct 0 ms 5384 KB Output is correct
6 Correct 0 ms 5384 KB Output is correct
7 Correct 0 ms 5384 KB Output is correct
8 Correct 0 ms 5384 KB Output is correct
9 Correct 0 ms 5384 KB Output is correct
10 Correct 0 ms 5384 KB Output is correct
11 Correct 0 ms 5384 KB Output is correct
12 Correct 0 ms 5384 KB Output is correct
13 Correct 0 ms 5384 KB Output is correct
14 Correct 0 ms 5384 KB Output is correct
15 Correct 0 ms 5384 KB Output is correct
16 Correct 0 ms 5384 KB Output is correct
17 Correct 0 ms 5384 KB Output is correct
18 Correct 0 ms 5384 KB Output is correct
19 Correct 0 ms 5384 KB Output is correct
20 Correct 0 ms 5384 KB Output is correct

Subtask #5
0.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 5384 KB Output is correct
2 Correct 48 ms 5384 KB Output is correct
3 Execution timed out 1500 ms 5384 KB Program timed out
4 Halted 0 ms 0 KB -