제출 #151865

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
151865		Ruxandra985	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	85 ms	35148 KiB

skyscraper

/// ...nupotsacredceamfacut
#include <cstdio>
#include <deque>
#include <vector>
#include <algorithm>
#define DIM 2010
#define DIMN 30010

using namespace std;
int f[DIM][DIM],dp[DIM][DIM],ch[DIMN];
pair <int,int> v[DIMN];
deque <pair <int,int> > dq;
vector <int> poz[DIMN];
int main()
{
    FILE *fin = stdin;
    FILE *fout = stdout;
    int n,m,i,curr,jump,idx,j;
    fscanf (fin,"%d%d",&n,&m);
    for (i=1;i<=m;i++){
        fscanf (fin,"%d%d",&v[i].first,&v[i].second);
        v[i].first++;
        poz[v[i].first].push_back(i);
    }
    for (i=1;i<DIM;i++)
        for (j=1;j<DIM;j++)
            dp[i][j] = 2000000000;
    ch[v[1].first] = 1;
    for (i=0;i<poz[v[1].first].size();i++){
        idx = poz[v[1].first][i];
        dp[v[1].first][v[idx].second] = 0;
        f[v[1].first][v[idx].second] = 1;
        dq.push_back(make_pair(v[1].first,v[idx].second));
    }
    while (!dq.empty()){
        curr = dq.front().first;
        jump = dq.front().second;
        //if (curr == 3 && jump == 2)
          //  printf ("a");
        if (curr == v[2].first)
            break;
        dq.pop_front();
        /// distanta minima ca sa ajungi in skyscrape ul curr cu jump

        if (curr + jump <= n){ /// faci o saritura
            /// nu schimbi
            if (!f[curr + jump][jump]){
                f[curr+jump][jump] = 1;
                dp[curr + jump][jump] = 1 + dp[curr][jump];
                dq.push_back(make_pair(curr+jump,jump));
            }
            if (!ch[curr + jump]){ /// schimbi
                ch[curr + jump] = 1;
                for (i=0;i<poz[curr+jump].size();i++){
                    idx = poz[curr + jump][i];
                    if (!f[curr + jump][v[idx].second]){
                        f[curr + jump][v[idx].second] = 1;
                        dp[curr + jump][v[idx].second] = 1 + dp[curr][jump];
                        dq.push_back(make_pair(curr+jump , v[idx].second));
                    }
                }
            }
        }


         if (curr - jump > 0){ /// faci o saritura
            /// nu schimbi
            if (!f[curr - jump][jump]){
                f[curr - jump][jump] = 1;
                dp[curr - jump][jump] = 1 + dp[curr][jump];
                dq.push_back(make_pair(curr-jump,jump));
            }
            if (!ch[curr - jump]){ /// schimbi
                ch[curr - jump] = 1;
                for (i=0;i<poz[curr-jump].size();i++){
                    idx = poz[curr - jump][i];
                    if (!f[curr - jump][v[idx].second]){
                        f[curr - jump][v[idx].second] = 1;
                        dp[curr - jump][v[idx].second] = 1 + dp[curr][jump];
                        dq.push_back(make_pair(curr-jump , v[idx].second));
                    }
                }
            }
        }
    }
    if (dq.empty())
        fprintf (fout,"-1");
    else fprintf (fout,"%d",dp[curr][jump]);
    return 0;
}

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

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:29:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i=0;i<poz[v[1].first].size();i++){
              ~^~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:54:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (i=0;i<poz[curr+jump].size();i++){
                          ~^~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:75:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (i=0;i<poz[curr-jump].size();i++){
                          ~^~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:19:12: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     fscanf (fin,"%d%d",&n,&m);
     ~~~~~~~^~~~~~~~~~~~~~~~~~
skyscraper.cpp:21:16: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         fscanf (fin,"%d%d",&v[i].first,&v[i].second);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 12 / 12
• Subtask 3: 14 / 14
• Subtask 4: 21 / 21
• Subtask 5: 0 / 43