oj.uz

답안 #634948

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
634948 2022-08-25T09:23:36 Z minhcool 라멘 (JOI14_ramen) C++17
0 / 100
 0 ms 212 KB 
#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 = vc1[i];
    }
    for(int i = 1; i < vc2.size(); i++){
        if(Compare(vc2[i], cur_mn) == 1) cur_mn = vc2[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();
}
*/

Compilation message

ramen.cpp:19:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   19 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~
ramen.cpp: In function 'void Ramen(int)':
ramen.cpp:43:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for(int i = 1; i < vc1.size(); i++){
      |                    ~~^~~~~~~~~~~~
ramen.cpp:46:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for(int i = 1; i < vc2.size(); i++){
      |                    ~~^~~~~~~~~~~~

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 0 ms 212 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 0 ms 212 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 0 ms 212 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -