Submission #187215
Source Code Expand
//////////////////// /// template /// //////////////////// #include <cstdio> #include <cstring> #include <cmath> #include <iostream> #include <sstream> #include <algorithm> #include <numeric> #include <functional> #include <vector> #include <queue> #include <string> #include <complex> #include <stack> #include <set> #include <map> #include <list> using namespace std; //// MACRO //// #define REP(i,n) for (int i = 0; i < (n); i++) #define RREP(i,n) for (int i = (n)-1; i >= 0; i--) #define FOR(i,s,n) for (int i = (s); i < (n); i++) #define allof(c) c.begin(), c.end() #define partof(c,i,n) c.begin() + (i), c.begin() + (i) + (n) #define EPS 1e-9 #define INF 1000000000 #define countof(a) (sizeof(a)/sizeof(a[0])) #define PREDIACTE(t,a) [](const t & a) -> bool #define COMPARISON(t,a,b) [](const t & a, const t & b) -> bool // start up // void solve(); int main() { solve(); return 0; } //// prime //// vector<unsigned char> isPrime; vector<int> primes; void initPrimes(int n) { isPrime = vector<unsigned char>(n + 1, true); isPrime[0] = isPrime[1] = false; FOR(i, 2, n + 1) { if (!isPrime[i]) continue; primes.push_back(i); for (int j = i * 2; j <= n; j += i) isPrime[j] = false; } } //// iota iterator //// struct iotait { int n; iotait(int n = 0) : n(n) { } iotait &operator ++() { ++n; return *this; } int operator *() { return n; } }; //// geo //// struct P3 { double x, y, z; P3(double x=0, double y=0, double z=0) : x(x), y(y), z(z) { } P3 operator +() const { return *this; } P3 operator +(const P3 &_) const { return P3(x+_.x, y+_.y, z+_.z); } P3 operator -() const { return P3(-x, -y, -z); } P3 operator -(const P3 &_) const { return *this + -_; } P3 operator *(double _) const { return P3(x*_,y*_,z*_); } P3 operator /(double _) const { return P3(x/_,y/_,z/_); } double dot(const P3 &_) const { return x*_.x + y*_.y + z*_.z; } P3 cross(const P3 &_) const { return P3(y*_.z-z*_.y, z*_.x-x*_.z, x*_.y-y*_.x); } double sqlength() const { return x*x+y*y+z*z; } double length() const { return sqrt(sqlength()); } P3 direction() const { return *this / length(); } }; struct Sphere { P3 c; double r; Sphere(double x, double y, double z, double r) : c(x,y,z), r(r) { } }; //// graph //// struct Path { int from; int to; double cost; Path(int from = 0, int to = 0, double cost = 0) : from(from), to(to), cost(cost) { } bool operator < (const Path &rhs) const { return cost < rhs.cost; } bool operator > (const Path &rhs) const { return cost > rhs.cost; } }; // prim // pair<double, vector<int>> prim(const vector<vector<double>> &costTable) { int N = costTable.size(); priority_queue<Path, vector<Path>, greater<Path>> q; q.push(Path(0, 0, 0)); vector<int> parent(N, -1); double totalCost = 0; while (!q.empty()) { Path cur = q.top(); q.pop(); int i = cur.to; if (parent[i] != -1) continue; parent[i] = cur.from; totalCost += cur.cost; REP(j,N) if (parent[j] == -1) q.push(Path(i,j,costTable[i][j])); } return make_pair(totalCost, parent); } // dijkstra // pair<vector<double>, vector<int>> dijkstra(const vector<vector<Path>> &routes, int start = 0, int goal = -1) { int N = routes.size(); priority_queue<Path, vector<Path>, greater<Path>> q; q.push(Path(start, start, 0)); vector<int> prev(N, -1); vector<double> cost(N, INF); while (!q.empty()) { Path cur = q.top(); q.pop(); int i = cur.to; if (prev[i] != -1) continue; prev[i] = cur.from; cost[i] = cur.cost; if (i == goal) { break; } REP(j, routes[i].size()) { Path next = Path(i, routes[i][j].to, cur.cost + routes[i][j].cost); if (prev[next.to] == -1) q.push(next); } } return make_pair(cost, prev); } //// i/o //// template <class T> class vevector : public vector<vector<T>> { public: vevector(int n = 0, int m = 0) : vector<vector<T>>(n, vector<T>(m)) { }; vevector(int n, int m, const T &initial) : vector<vector<T>>(n, vector<T>(m, initial)) { }; }; template <class T> T read() { T t; cin >> t; return t; } template <class T> vector<T> read(int n) { vector<T> v; REP(i,n) { v.push_back(read<T>()); } return v; } template <class T> vevector<T> read(int n, int m) { vevector<T> v; REP(i,n) v.push_back(read<T>(m)); return v; } template <class T> vevector<T> readjag(int n) { vevector<T> v; REP(i,n) v.push_back(read<T>(read<int>())); return v; } template <class T> void write(const T &t) { cout << t << endl; } template <class T> void write(const T &t, const T &t2) { cout << t << ' ' << t2 << endl; } template <class T> void write(const vector<T> &v) { ostringstream ss; for (auto x : v) ss << x << ' '; auto s = ss.str(); cout << s.substr(0, s.length() - 1) << endl; } struct _Reader { template <class T> _Reader operator ,(T &rhs) { cin >> rhs; return *this; } }; #define READ(t,...) t __VA_ARGS__; _Reader(), __VA_ARGS__ //////////////////// /// template end /// //////////////////// void solve() { READ(string, S); string r; transform(allof(S), back_inserter(r), tolower); r[0] = toupper(r[0]); write(r); }
Submission Info
Submission Time | |
---|---|
Task | B - 名前の確認 |
User | ttsuki |
Language | C++11 (GCC 4.8.1) |
Score | 0 |
Code Size | 5197 Byte |
Status | CE |
Compile Error
./Main.cpp: In function ‘void solve()’: ./Main.cpp:183:47: error: no matching function for call to ‘transform(std::basic_string<char>::iterator, std::basic_string<char>::iterator, std::back_insert_iterator<std::basic_string<char> >, <unresolved overloaded function type>)’ transform(allof(S), back_inserter(r), tolower); ^ ./Main.cpp:183:47: note: candidates are: In file included from /usr/include/c++/4.8/algorithm:62:0, from ./Main.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h:4938:5: note: template<class _IIter, class _OIter, class _UnaryOperation> _OIter std::transform(_IIter, _IIter, _OIter, _UnaryOperation) transform(_InputIterator __first, _InputIterator __last, ^ /usr/include/c++/4.8/bits/stl_algo.h:4938:5: note: template argument deduction/substitution failed: ./Main.cpp:183:47: note: couldn't deduce template parameter ‘_UnaryOperation’ transform(allof(S), back_inserter(r), tolower); ...