oj.uz

Submission #4605

# Submission time Handle Problem Language Result Execution time Memory
4605 2013-11-10T02:54:58 Z Namnamseo 그릇 (KOI13_bowl) C++
16 / 16
 0 ms 1088 KB 
#include <stdio.h>

int main()
{
  char bef_state=-1;
  char buf[51];
  int h=0;
  scanf("%s",buf);
  int i;
  for(i=0;;i++)
  {
    if(buf[i]==0) break;
    else
    {
      if(bef_state==buf[i])
      {
        h+=5;
      }
      else
      {
        bef_state=buf[i]; h+=10;
      }
    }
  }
  printf("%d",h);
  return 0;
}

Subtask #1
3.2 / 3.2

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1088 KB Output is correct
2 Correct 0 ms 1088 KB Output is correct
3 Correct 0 ms 1088 KB Output is correct
4 Correct 0 ms 1088 KB Output is correct
5 Correct 0 ms 1088 KB Output is correct

Subtask #2
3.2 / 3.2

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1088 KB Output is correct
2 Correct 0 ms 1088 KB Output is correct
3 Correct 0 ms 1088 KB Output is correct
4 Correct 0 ms 1088 KB Output is correct
5 Correct 0 ms 1088 KB Output is correct

Subtask #3
3.2 / 3.2

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1088 KB Output is correct
2 Correct 0 ms 1088 KB Output is correct
3 Correct 0 ms 1088 KB Output is correct
4 Correct 0 ms 1088 KB Output is correct
5 Correct 0 ms 1088 KB Output is correct

Subtask #4
3.2 / 3.2

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1088 KB Output is correct
2 Correct 0 ms 1088 KB Output is correct
3 Correct 0 ms 1088 KB Output is correct
4 Correct 0 ms 1088 KB Output is correct
5 Correct 0 ms 1088 KB Output is correct

Subtask #5
3.2 / 3.2

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1088 KB Output is correct
2 Correct 0 ms 1088 KB Output is correct
3 Correct 0 ms 1088 KB Output is correct
4 Correct 0 ms 1088 KB Output is correct
5 Correct 0 ms 1088 KB Output is correct