제출 #499855

#제출 시각아이디문제언어결과실행 시간메모리
499855robellGap (APIO16_gap)C++14
컴파일 에러
0 ms0 KiB
/* Problem: Problem Link: Notes: */ #pragma GCC optimize("O2") #include <bits/stdc++.h> #include "gap.h" #include <ext/pb_ds/assoc_container.hpp> using namespace std; using namespace __gnu_pbds; typedef tree<int,null_type,less<int>,rb_tree_tag, tree_order_statistics_node_update> indexed_set; typedef long long ll; #define pb push_back #define eb emplace_back #define countbits __builtin_popcount #define beg0 __builtin_clz #define terminal0 __builtin_ctz #define f first #define s second int mod=1e9+7; inline void rv(int &n){ n=0;int m=1;char c=getchar();if (c=='-'){m=-1; c=getchar();} for (;c>47 && c<58;c=getchar()){n=n*(1<<1)+n*(1<<3)+c-48;} n*=m; } inline void rv(ll &n){ n=0;int m=1;char c=getchar();if (c=='-'){m=-1; c=getchar();} for (;c>47 && c<58;c=getchar()){n=n*(1<<1)+n*(1<<3)+c-48;} n*=m; } inline void rv(double &n){ n=0;int m=1;char c=getchar(); if (c=='-'){m=-1; c=getchar();}for (;c>47 && c<58;c=getchar()){n=n*(1<<1)+n*(1<<3)+c-48;} if (c=='.'){double p = 0.1;c=getchar();for (;c>47 && c<58;c=getchar()){n+=((c-48)*p);p/=10;}} n*=m; } inline void rv(float &n){ n=0;int m=1;char c=getchar(); if (c=='-'){m=-1; c=getchar();}for (;c>47 && c<58;c=getchar()){n=n*(1<<1)+n*(1<<3)+c-48;} if (c=='.'){double p = 0.1;c=getchar();for (;c>47 && c<58;c=getchar()){n+=((c-48)*p);p/=10;}} n*=m; } inline void rv(string &w){w="";char c=getchar();while (c!=' '&&c!='\n'&&c!=EOF){w+=c;c=getchar();}} inline void rv(char &c){c=getchar();} template<typename T, typename ...Types> void rv(T &n, Types&&... args){rv(n);rv(args...);} void setIO(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } void setIO(string f){ freopen((f+".in").c_str(),"r",stdin); freopen((f+".out").c_str(),"w",stdout); setIO(); } ll a[100000],j=0; ll findGap(int T, ll N){ if (T==1) { ll l=1,r=1e18; ll mn,mx; vector<ll> v; for (ll i=0;i<(N+1)/2;i++) { MinMax(l,r,&mn,&mx); a[j++] = mn; a[j++] = mx; l=mn+1,r=mx-1; } sort(a,a+N); ll ans=0; for (ll i=0;i<N-1;i++)ans=max(ans,a[i+1]-a[i]); return ans; } else { ll mn, mx; MinMax(1,1e18,&mn,&mx); ll step=(mx-mn+N-2)/(N-1); ll ans=step,x,y,l=mn,i; for (i=mn;i+step<mx;i+=step+1){ MinMax(i,i+step,&x,&y); if(x!=-1){ ans=max(ans,x-l); l=y; } } MinMax(i, mx, &x, &y); if (x!=-1)ans=max(ans,x-l); return ans; } }

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

gap.cpp: In function 'void setIO(std::string)':
gap.cpp:53:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |  freopen((f+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
gap.cpp:54:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |  freopen((f+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/bin/ld: /tmp/ccBvbWR0.o: in function `main':
grader.cpp:(.text.startup+0x1b7): undefined reference to `findGap(int, int)'
collect2: error: ld returned 1 exit status