Submission #1280588

#TimeUsernameProblemLanguageResultExecution timeMemory
1280588njoop라멘 (JOI14_ramen)C++20
0 / 100
1 ms340 KiB
#include "ramen.h" #include <bits/stdc++.h> using namespace std; vector<int> s, l; void Ramen(int N) { if(N == 1) { Answer(0, 0); return; } for(int i=0; i<N-1; i+=2) { if(Compare(i, i+1) == 1) { l.push_back(i); s.push_back(i+1); } else { l.push_back(i+1); s.push_back(i); } } if(N%2 == 1) { l.push_back(N-1); s.push_back(N-1); } int sm = s[0], lg = l[0]; for(int i=1; i<s.size(); i++) { if(Compare(sm, s[i]) == 1) { sm = l[i]; } } for(int i=1; i<l.size(); i++) { if(Compare(l[i], lg) == 1) { lg = l[i]; } } Answer(sm, lg); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...