제출 #745157

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
745157		jjcoder	밀림 점프 (APIO21_jumps)	C++14	0 / 100	1 ms	336 KiB

jumps

#include <bits/stdc++.h>
#include <cstdio>

using namespace std;
#define ll long long int
#define ull unsigned long long int
#define forn(a,b) for(int a=0; a<b; a++)
#define FOR(a,b) for(int a=1; a<=b; a++)
#define getmax(a,b) ((a)>(b)?(a):(b))
#define mp(a,b) make_pair(a,b)
#define vi vector<int>
#define vull vector<unsigned long long int>
#define vll vector<long long int>
#define vp vector<pair<int,int>>
#define vs vector<string>
#define pb push_back
#define s(a) sort(a.begin(),a.end())
#define sr(a) sort(a.rbegin(),a.rend())
int z=1e9+7;
int arr[20001],arr1[200010];

// find the number of digit in an integer : floor(log10(n))+1
/*vector<pair<int,int>>vec;
    vec.push_back({2,3});
    vec.push_back({3,2});
    sort(vec.rbegin(),vec.rend());
    cout << vec[0].first<<" "<<vec[0].second <<endl;
    cout << vec[1].first<<" "<<vec[1].second <<endl;
    */

/*for (auto it = v.begin(); it != v.end(); ++it) { // for map<ll,vector<ll>>qweqwe
    cout << "Key: " << it->first << ", Values: ";
    for (auto val : it->second) {
        cout << val << " ";
    }
    cout << endl;
}*/

/*for (auto& iter: s) { // for map<int,int>qweqwe
    	std::cout << iter.first << ": " << iter.second << std::endl;
  	}*/

/*int factorial(ull y)
{
    if(y<=1)return 1;
    else return y*factorial(y-1);
}
void setIO(string n)
{
    freopen((n+".in").c_str(),"r",stdin);
    freopen((n+".out").c_str(),"w",stdout);
}
*/
vi H;
void init(int N, vi H)
{
    return;
}
int minimum_jumps(int A, int B, int C, int D)
{
    vi ans;
    for(int l=A; l<=B; l++)
    {
        for(int x=C; x<=D; x++)
        {
            vp visited,queue_up;
            int n=0,k=H[l];
            queue_up.pb(mp(H[l],n));
            while(!queue_up.empty())
            {
                n++;
                for(int i=l; i>=0; i--)
                {
                    if(H[i]>H[l])
                    {
                        queue_up.insert(queue_up.begin(),mp(H[i],n));
                        break;
                    }
                }
                for(int i=l; i<=H.size(); i++)
                {
                    if(H[i]>H[l])
                    {
                        queue_up.insert(queue_up.begin(),mp(H[i],n));
                        break;
                    }
                }
                visited.pb(mp(k,n));
                queue_up.pop_back();
                k=queue_up[queue_up.size()-1].first;
            }
            for(int i=0; i<=visited.size(); i++){
                if(visited[i].first==x)ans.pb(visited[i].second);
            }
        }
    }
    s(ans);
    return ans[0];//ans
}

int xmain()
{
    //setIO("input");
    ios::sync_with_stdio(0);
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:80:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |                 for(int i=l; i<=H.size(); i++)
      |                              ~^~~~~~~~~~
jumps.cpp:92:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |             for(int i=0; i<=visited.size(); i++){
      |                          ~^~~~~~~~~~~~~~~~

• Subtask 1: 0 / 4
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 0 / 23
• Subtask 6: 0 / 21
• Subtask 7: 0 / 19