제출 #1054177

#제출 시각아이디문제언어결과실행 시간메모리
1054177kiryl_krutskoPalembang Bridges (APIO15_bridge)C++14
컴파일 에러
0 ms0 KiB
#include <iostream>#include <vector>#include <cmath>using namespace std;struct way { int left, right; way(int n1, int n2) { left = min(n1, n2); right = max(n1, n2); }};int bs(int start, int end, vector<way>* vec, int start_ans) { int ans = start_ans; int right = 0; int left = 0; int mid = (start + end) / 2; //cout << mid << " : "; for (int i = 0; i < vec->size();i++) { way cur = vec->at(i); if (cur.right < mid) { ans += (mid - cur.right) * 2; left++; } else if (cur.left > mid) { ans += (cur.left - mid) * 2; right++; } else if (cur.left<start && cur.right>start) { vec->erase(vec->begin() + i); i--; } } //cout << left << " " << right << " " << endl << "ans : " << ans << endl; if (right == left || start == end) { //cout << mid << endl; return ans; } else if (right > left) { return bs(mid + 1, end, vec, start_ans); } else { return bs(start, mid, vec, start_ans); }}int main(){ int n, k, ans; cin >> k >> n; ans = 0; vector<way> vec; int n1, n2; char t1, t2; int max = 0; int min = 1000000001; for (int i = 0; i < n; i++) { cin >> t1 >> n1 >> t2 >> n2; ans += abs(n1 - n2); if (t1 != t2) { ans++; way w = way(n1, n2); if (w.left < min) min = w.left; if (w.right > max) max = w.right; vec.push_back(w); } } if (k == 1) { cout << bs(min, max, &vec, ans) << endl; }}

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

bridge.cpp:1:20: warning: extra tokens at end of #include directive
    1 | #include <iostream>#include <vector>#include <cmath>using namespace std;struct way {  int left, right;  way(int n1, int n2) {    left = min(n1, n2);    right = max(n1, n2);  }};int bs(int start, int end, vector<way>* vec, int start_ans) {  int ans = start_ans;  int right = 0;  int left = 0;  int mid = (start + end) / 2;  //cout << mid << " : ";  for (int i = 0; i < vec->size();i++) {    way cur = vec->at(i);    if (cur.right < mid) {      ans += (mid - cur.right) * 2;      left++;    }    else if (cur.left > mid) {      ans += (cur.left - mid) * 2;      right++;    }    else if (cur.left<start && cur.right>start) {      vec->erase(vec->begin() + i);      i--;    }  }  //cout << left << " " << right << " " << endl << "ans : " << ans << endl;  if (right == left || start == end) {    //cout << mid << endl;    return ans;  }  else if (right > left) {    return bs(mid + 1, end, vec, start_ans);  }  else {    return bs(start, mid, vec, start_ans);  }}int main(){  int n, k, ans;  cin >> k >> n;  ans = 0;  vector<way> vec;  int n1, n2;  char t1, t2;  int max = 0;  int min = 1000000001;  for (int i = 0; i < n; i++) {    cin >> t1 >> n1 >> t2 >> n2;    ans += abs(n1 - n2);    if (t1 != t2) {      ans++;      way w = way(n1, n2);      if (w.left < min) min = w.left;      if (w.right > max) max = w.right;      vec.push_back(w);    }  }  if (k == 1) {    cout << bs(min, max, &vec, ans) << endl;  }}
      |                    ^
/usr/bin/ld: /usr/lib/gcc/x86_64-linux-gnu/10/../../../x86_64-linux-gnu/crt1.o: in function `_start':
(.text+0x24): undefined reference to `main'
collect2: error: ld returned 1 exit status