제출 #921093

#제출 시각아이디문제언어결과실행 시간메모리
921093salmon고대 책들 (IOI17_books)C++14
컴파일 에러
0 ms0 KiB
#include <cstdio>#include <vector>#include <bits/stdc++.h>using namespace std; long long minimum_walk(vector<int> p, int s) { bool done[1100100]; int N = p.size(); int un = N; int soom = 0; int i = 0; /*while(un != 0){ if(start ) }*/ int fre = 0; for(int i = 0; i < N; i++){ if(done[i]) continue; if(i > fre){ soom += 2; } fre = max(fre,i); int j = p[i]; soom += abs(j - i); while(j != i){ int temp = j; fre = max(fre,j); done[j] = true; j = p[j]; soom += abs(temp - j); } } for(int i = N - 1; i > 0; i--){ if(p[i] != i){ break; } soom -= 2; } return soom;}

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

books.cpp:1:18: warning: extra tokens at end of #include directive
    1 | #include <cstdio>#include <vector>#include <bits/stdc++.h>using namespace std; long long minimum_walk(vector<int> p, int s) {    bool done[1100100];    int N = p.size();     int un = N;    int soom = 0;     int i = 0;     /*while(un != 0){        if(start )    }*/    int fre = 0;      for(int i = 0; i < N; i++){        if(done[i]) continue;         if(i > fre){            soom += 2;        }         fre = max(fre,i);        int j = p[i];        soom += abs(j - i);        while(j != i){            int temp = j;            fre = max(fre,j);            done[j] = true;            j = p[j];            soom += abs(temp - j);        }    }     for(int i = N - 1; i > 0; i--){        if(p[i] != i){            break;        }        soom -= 2;    }       return soom;}
      |                  ^
/usr/bin/ld: /tmp/ccb4uEW0.o: in function `main':
grader.cpp:(.text.startup+0x26b): undefined reference to `minimum_walk(std::vector<int, std::allocator<int> >, int)'
collect2: error: ld returned 1 exit status