Submission #146847
Source Code Expand
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <utility>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <sys/time.h>
#include <vector>
using namespace std;
#define i64 int64_t
#define rep(i, n) for(i64 i = 0; i < ((i64)(n)); ++i)
#define sz(v) ((i64)((v).size()))
#define bit(n) (((i64)1)<<((i64)(n)))
#define all(v) (v).begin(), (v).end()
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class ...Ts> std::ostream& operator<<(std::ostream &os, const std::tuple<Ts...> &t){ os << "("; deploy<0, std::tuple<Ts...>, Ts...>(os, t); os << ")"; return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "" : ", "); os << "}"; return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "" : ", "); os << "}"; return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::queue<T> &q){ os << "{"; for(; !q.empty(); q.pop()){ os << q.front() << (q.size() != 1 ? ", " : ""); } os << "}"; return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::priority_queue<T> &q){ os << "{"; for(; !q.empty(); q.pop()){ os << q.top() << (q.size() != 1 ? ", " : ""); } os << "}"; return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::pair<T, K> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "" : ", "); os << "}"; return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::unordered_map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "" : ", "); os << "}"; return os; }
#define DEBUG1(var0) { std::cout << (#var0) << "=" << (var0) << std::endl; }
#define DEBUG2(var0, var1) { std::cout << (#var0) << "=" << (var0) << ", " << (#var1) << "=" << (var1) << std::endl; }
#define DEBUG3(var0, var1, var2) { std::cout << (#var0) << "=" << (var0) << ", " << (#var1) << "=" << (var1) << ", " << (#var2) << "=" << (var2) << std::endl; }
#define DEBUG4(var0, var1, var2, var3) { std::cout << (#var0) << "=" << (var0) << ", " << (#var1) << "=" << (var1) << ", " << (#var2) << "=" << (var2) << ", " << (#var3) << "=" << (var3) << std::endl; }
#define DEBUG5(var0, var1, var2, var3, var4) { std::cout << (#var0) << "=" << (var0) << ", " << (#var1) << "=" << (var1) << ", " << (#var2) << "=" << (var2) << ", " << (#var3) << "=" << (var3) << ", " << (#var4) << "=" << (var4) << std::endl; }
#define DEBUG6(var0, var1, var2, var3, var4, var5) { std::cout << (#var0) << "=" << (var0) << ", " << (#var1) << "=" << (var1) << ", " << (#var2) << "=" << (var2) << ", " << (#var3) << "=" << (var3) << ", " << (#var4) << "=" << (var4) << ", " << (#var5) << "=" << (var5) << std::endl; }
int main()
{
i64 n;
cin >> n;
vector<i64> a(n);
rep(i, n) cin >> a[i];
cout << *min_element(all(a)) << endl;
}
Submission Info
Submission Time |
|
Task |
B - おいしいたこ焼きの食べ方 |
User |
Komaki |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
3726 Byte |
Status |
AC |
Exec Time |
51 ms |
Memory |
928 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
rand0.txt, rand1.txt, rand10.txt, rand11.txt, rand12.txt, rand13.txt, rand14.txt, rand15.txt, rand16.txt, rand17.txt, rand18.txt, rand19.txt, rand2.txt, rand20.txt, rand21.txt, rand22.txt, rand23.txt, rand24.txt, rand25.txt, rand26.txt, rand27.txt, rand28.txt, rand29.txt, rand3.txt, rand4.txt, rand5.txt, rand6.txt, rand7.txt, rand8.txt, rand9.txt, s1.txt, s2.txt, s3.txt |
Case Name |
Status |
Exec Time |
Memory |
rand0.txt |
AC |
24 ms |
900 KB |
rand1.txt |
AC |
22 ms |
840 KB |
rand10.txt |
AC |
23 ms |
804 KB |
rand11.txt |
AC |
21 ms |
924 KB |
rand12.txt |
AC |
21 ms |
916 KB |
rand13.txt |
AC |
23 ms |
800 KB |
rand14.txt |
AC |
31 ms |
732 KB |
rand15.txt |
AC |
21 ms |
924 KB |
rand16.txt |
AC |
21 ms |
924 KB |
rand17.txt |
AC |
22 ms |
732 KB |
rand18.txt |
AC |
21 ms |
732 KB |
rand19.txt |
AC |
27 ms |
848 KB |
rand2.txt |
AC |
22 ms |
924 KB |
rand20.txt |
AC |
23 ms |
924 KB |
rand21.txt |
AC |
23 ms |
928 KB |
rand22.txt |
AC |
23 ms |
924 KB |
rand23.txt |
AC |
22 ms |
848 KB |
rand24.txt |
AC |
21 ms |
732 KB |
rand25.txt |
AC |
42 ms |
800 KB |
rand26.txt |
AC |
21 ms |
924 KB |
rand27.txt |
AC |
21 ms |
928 KB |
rand28.txt |
AC |
47 ms |
800 KB |
rand29.txt |
AC |
22 ms |
732 KB |
rand3.txt |
AC |
21 ms |
808 KB |
rand4.txt |
AC |
22 ms |
924 KB |
rand5.txt |
AC |
22 ms |
884 KB |
rand6.txt |
AC |
23 ms |
924 KB |
rand7.txt |
AC |
22 ms |
924 KB |
rand8.txt |
AC |
21 ms |
920 KB |
rand9.txt |
AC |
25 ms |
884 KB |
s1.txt |
AC |
51 ms |
792 KB |
s2.txt |
AC |
23 ms |
924 KB |
s3.txt |
AC |
23 ms |
840 KB |