結果

問題 No.831 都市めぐり
ユーザー koyumeishikoyumeishi
提出日時 2019-05-24 22:46:11
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 4,385 bytes
コンパイル時間 1,051 ms
コンパイル使用メモリ 120,916 KB
最終ジャッジ日時 2024-11-14 21:27:58
合計ジャッジ時間 1,456 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp: In instantiation of 'std::ostream& {anonymous}::operator<<(std::ostream&, const std::pair<_T1, _T2>&) [with T = long long int; S = std::vector<int>; std::ostream = std::basic_ostream<char>]':
main.cpp:29:53:   required from 'void {anonymous}::print(const H&) [with H = std::pair<long long int, std::vector<int> >]'
main.cpp:31:65:   required from 'void {anonymous}::println(const T& ...) [with T = {std::pair<long long int, std::vector<int, std::allocator<int> > >}]'
main.cpp:81:12:   required from here
main.cpp:25:113: error: no match for 'operator<<' (operand types are 'std::basic_ostream<char>' and 'const std::vector<int>')
   25 |   template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
      |                                                                                            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/iostream:39,
                 from main.cpp:1:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:108:7: note: candidate: 'std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(__ostream_type& (*)(__ostream_type&)) [with _CharT = char; _Traits = std::char_traits<char>; __ostream_type = std::basic_ostream<char>]'
  108 |       operator<<(__ostream_type& (*__pf)(__ostream_type&))
      |       ^~~~~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:108:36: note:   no known conversion for argument 1 from 'const std::vector<int>' to 'std::basic_ostream<char>::__ostream_type& (*)(std::basic_ostream<char>::__ostream_type&)' {aka 'std::basic_ostream<char>& (*)(std::basic_ostream<char>&)'}
  108 |       operator<<(__ostream_type& (*__pf)(__ostream_type&))
      |                  ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:117:7: note: candidate

ソースコード

diff # 

#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

int main(){
  long long n;
  cin >> n;

  if(false){
    vector<vector<pair<long long, vector<int>>>> dp(1<<n, vector<pair<long long, vector<int>>>(n, {1ll<<50, {}}));
    dp[1][0] = {0, {-1}};
    for(int i=0; i<(1<<n); i++){
      for(int j=0; j<n; j++){
        for(int k=0; k<n; k++){
          if((i>>k)&1) continue;
          if(dp[i|1<<k][k].first > dp[i][j].first + (j+1ll) * (k+1ll)){
            dp[i|1<<k][k].first = dp[i][j].first + (j+1ll) * (k+1ll);
            dp[i|1<<k][k].second = dp[i][j].second;
            dp[i|1<<k][k].second.push_back(-k-1);
          }
        }
      }
    }
    pair<long long,vector<int>> ans = {1ll<<50, {}};
    for(int i=0; i<n; i++){
      if(ans.first > dp[(1<<n)-1][i].first + i+1){
        ans = dp[(1<<n)-1][i];
        ans.first += i+1;
      }
    }

    println(ans);
  }
  
  //https://oeis.org/A110611
  {
    if(n == 1) println(0);
    else if(n%2 == 0){
      println((n*n*n + 3*n*n + 5*n - 6) / 6);
    }else{
      println((n*n*n + 3*n*n + 5*n - 3) / 6);
    }
  }

  return 0;
}
0