제출 #819785

#제출 시각아이디문제언어결과실행 시간메모리
819785alvingogo던전 (IOI21_dungeons)C++17
컴파일 에러
0 ms0 KiB
#include "dungeons.h" #include <bits/stdc++.h> #define fs first #define sc second #define p_q priority_queue using namespace std; const int A=25; typedef long long ll; struct xe{ int to; ll cost=0; ll mx=0; }; struct no{ xe as[25]; }; vector<vector<no> > f; vector<int> s,p,w,l; int n; void init(int N, vector<int> S, vector<int> P, vector<int> W, vector<int> L) { n=N; s=S; p=P; w=W; l=L; f.resize(A); for(int z=0;z<A;z++){ f[z].resize(n+1); for(int i=0;i<n;i++){ if((1<<z)>=s[i]){ f[z][i].as[0].to=w[i]; f[z][i].as[0].cost=s[i]; f[z][i].as[0].mx=1e18; } else{ f[z][i].as[0].to=l[i]; f[z][i].as[0].cost=p[i]; f[z][i].as[0].mx=s[i]; } } for(int i=1;i<A;i++){ for(int j=0;j<n;j++){ auto a=f[z][j].as[i-1],b=f[z][f[z][j].as[i-1].to].as[i-1]; if(a.to==n){ f[z][j].as[i]=a; } else{ f[z][j].as[i].to=b.to; f[z][j].as[i].cost=a.cost+b.cost; f[z][j].as[i].mx=min(a.mx,b.mx-a.cost); } } } } return; } ll simulate(int x, int Z) { long long z=Z; for(int j=0;j<A;j++){ for(int i=A-1;i>=0;i--){ if(z<f[j][x].as[i].mx){ //cout << f[j][x].as[i].mx << " " << f[j][x].as[i].cost << endl; z+=f[j][x].as[i].cost; z=min(z,(int)2e7); x=f[j][x].as[i].to; if(x==n){ return z; } } } if(z>=s[x]){ z+=s[x]; x=w[x]; } else{ z+=p[x]; x=l[x]; } if(x==n){ return z; } } return z; }

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

dungeons.cpp: In function 'll simulate(int, int)':
dungeons.cpp:66:21: error: no matching function for call to 'min(long long int&, int)'
   66 |     z=min(z,(int)2e7);
      |                     ^
In file included from /usr/include/c++/10/vector:60,
                 from dungeons.h:1,
                 from dungeons.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:230:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  230 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:230:5: note:   template argument deduction/substitution failed:
dungeons.cpp:66:21: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   66 |     z=min(z,(int)2e7);
      |                     ^
In file included from /usr/include/c++/10/vector:60,
                 from dungeons.h:1,
                 from dungeons.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:278:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  278 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:278:5: note:   template argument deduction/substitution failed:
dungeons.cpp:66:21: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   66 |     z=min(z,(int)2e7);
      |                     ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from dungeons.cpp:2:
/usr/include/c++/10/bits/stl_algo.h:3468:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(std::initializer_list<_Tp>)'
 3468 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3468:5: note:   template argument deduction/substitution failed:
dungeons.cpp:66:21: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   66 |     z=min(z,(int)2e7);
      |                     ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from dungeons.cpp:2:
/usr/include/c++/10/bits/stl_algo.h:3474:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(std::initializer_list<_Tp>, _Compare)'
 3474 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3474:5: note:   template argument deduction/substitution failed:
dungeons.cpp:66:21: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   66 |     z=min(z,(int)2e7);
      |                     ^