# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
6001 |
2014-06-13T06:52:30 Z |
kriii |
라멘 (JOI14_ramen) |
C++ |
|
0 ms |
1180 KB |
#include "ramen.h"
#include <vector>
using namespace std;
void Ramen(int N) {
vector<int> A; A.push_back(0);
for (int i=1;i<N;i++){
int l = 0, r = A.size(), m;
while (l < r){
m = (l + r) / 2;
Compare(A[m],i) > 0 ? r = m : l = m+1;
}
A.insert(A.begin()+l,i);
}
Answer(A[0],A[N-1]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1180 KB |
Output is correct |
2 |
Correct |
0 ms |
1180 KB |
Output is correct |
3 |
Correct |
0 ms |
1180 KB |
Output is correct |
4 |
Correct |
0 ms |
1180 KB |
Output is correct |
5 |
Correct |
0 ms |
1180 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1180 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1180 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |