# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
634940 | minhcool | 라멘 (JOI14_ramen) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
ramen
#include "ramen.h"
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define fi first
#define se second
#define pb push_back
//#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
const int N = 1e5 + 5;
const int oo = 1e18 + 7, mod = 1e9 + 7;
int n;
void Ramen(int N){
n = N;
vector<int> vc1, vc2;
for(int i = 0; i < n; i += 2){
if(i == (n - 1)){
vc1.pb(i);
vc2.pb(i);
}
else{
if(Compare(i, i + 1) == 1){
vc2.pb(i);
vc1.pb(i + 1);
}
else{
vc1.pb(i);
vc2.pb(i + 1);
}
}
}
int cur_mn = vc1[0], cur_mx = vc2[0];
for(int i = 1; i < vc1.size(); i++){
if(Compare(vc1[i], cur_mx) == -1) cur_mx = i;
}
for(int i = 1; i < vc2.size(); i++){
if(Compare(vc2[i], cur_mn) == 1) cur_mn = i;
}
/*
for(int i = 1; i < n; i++){
if(Compare(i, cur_mx) == 1) cur_mx = i;
if(Compare(i, cur_mn) == -1) cur_mn = i;
}*/
Answer(cur_mx, cur_mn);
}
/*
signed main(){
ios_base::sync_with_stdio(0);
process();
}
*/