oj.uz

Submission #17599

# Submission time Handle Problem Language Result Execution time Memory
17599 2016-01-02T03:53:01 Z Namnamseo 라멘 (JOI14_ramen) C++
100 / 100
 0 ms 1132 KB 
#include "ramen.h"

int a[1024];
int b[1024];

void Ramen (int n){
    int i, ind=0;
    for(i=0;i*2+1<n;++i){
        if(Compare(i*2,i*2+1)==1){
            a[ind]=i*2; b[ind]=i*2+1;
        } else {
            a[ind]=i*2+1; b[ind]=i*2;
        }
        ++ind;
    }
    if(n&1) a[ind]=b[ind]=n-1, ++ind;
    int M=a[0], m=b[0];
    for(i=1;i<ind;++i){
        if(Compare(M,a[i])==-1) M=a[i];
        if(Compare(b[i],m)==-1) m=b[i];
    }
    Answer(m,M);
}

Compilation message

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

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