Submission #4647975
Source Code Expand
#include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
using P = pair<ll, ll>;
static ll imin = std::numeric_limits<ll>::min() / 10;
static ll imax = std::numeric_limits<ll>::max() / 10;
#define rep(i, n) for (ll i = 0; (i) < (n); ++(i))
#define rep1(i, n) for (ll i = 1; (i) < (n); ++(i))
#define rev_rep(i, n) for (ll i = (n)-1; (i) >= 0; --(i))
#define range(a, i, b) for (ll i = (a); (i) < (b); ++(i))
#ifdef LOCAL
#define dump(x) cout << #x << ":" << (x) << "\n";
#endif
#ifndef LOCAL
#define dump(x)
#endif
#define all(v) v.begin(), v.end()
#define readl(N) \
ll N; \
cin >> N;
#define readlv(N, vec) \
vector<ll> vec(N); \
rep(i, N) { cin >> vec[i]; }
#define greater_than [](ll l, ll r) { return l > r; }
template <class T1, class T2>
std::ostream &operator<<(std::ostream &os, std::map<T1, T2> &mp);
template <class T1, class T2>
std::ostream &operator<<(std::ostream &os, std::pair<T1, T2> &pair);
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &vec);
template <class T1, class T2>
std::ostream &operator<<(std::ostream &os, std::pair<T1, T2> &pair) {
os << '(' << pair.first << ',' << pair.second << ')';
return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &vec) {
std::size_t n = vec.size();
if (n == 0) {
return os;
}
os << " ";
for (ll i = 0; i < n - 1; ++i) {
os << vec[i] << " ";
}
os << vec[n - 1];
os << std::endl;
return os;
}
template <class T1, class T2>
std::ostream &operator<<(std::ostream &os, std::map<T1, T2> &mp) {
std::size_t n = mp.size();
if (n == 0) {
return os;
}
os << " ";
for (auto &&x : mp) {
os << x << " ";
}
os << std::endl;
return os;
}
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> &mp) {
std::size_t n = mp.size();
if (n == 0) {
return os;
}
os << " ";
for (auto &&x : mp) {
os << x << " ";
}
os << std::endl;
return os;
}
template <class T> inline bool chmin(T &a, T const b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T const b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll fact(ll n) {
ll res = 1;
while (n > 0) {
res *= n;
n--;
}
return res;
}
ll pow(ll i, ll n) {
ll res = 1;
while (n >= 0) {
res *= i;
n--;
}
return res;
}
ll gcd(ll l, ll r) {
if (l < r) {
return gcd(r, l);
}
if (r == 0) {
return l;
}
return gcd(r, l % r);
}
template <class T> vector<T> accum_sum(vector<T> const &a) {
vector<T> b(a.size() + 1);
b[0] = 0;
rep(i, a.size()) { b[i + 1] = b[i] + a[i]; }
return b;
}
constexpr ll mod = 1e9 + 7;
bool isprime(ll n) {
if (n < 2) {
return false;
}
range(2, i, sqrt(n) + 1) {
if (n == i) {
break;
}
if (n % i == 0) {
return false;
}
}
return true;
}
ll sum(ll n) {
ll res = 0;
rep(i, n + 1) { res += i; }
dump(res);
return res;
}
int main(int argc, char const *argv[]) {
ll N;
cin >> N;
vector<ll> a(N);
rep(i, N) { cin >> a[i]; }
ll seq = 1;
ll pre = imax;
ll res = 0;
rep(i, N) {
if (pre < a[i]) {
seq++;
} else {
seq = 1;
}
res += seq;
pre = a[i];
}
cout << res << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 単調増加 |
User |
tsukimizake |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
3743 Byte |
Status |
AC |
Exec Time |
31 ms |
Memory |
1024 KB |
Judge Result
Set Name |
Sample |
Subtask0 |
All |
Score / Max Score |
0 / 0 |
40 / 40 |
60 / 60 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
sample0.txt, sample1.txt, sample2.txt, sample3.txt |
Subtask0 |
sample0.txt, sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt |
All |
sample0.txt, sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt |
Case Name |
Status |
Exec Time |
Memory |
sample0.txt |
AC |
1 ms |
256 KB |
sample1.txt |
AC |
1 ms |
256 KB |
sample2.txt |
AC |
1 ms |
256 KB |
sample3.txt |
AC |
1 ms |
256 KB |
subtask0_0.txt |
AC |
2 ms |
256 KB |
subtask0_1.txt |
AC |
2 ms |
256 KB |
subtask0_10.txt |
AC |
2 ms |
256 KB |
subtask0_11.txt |
AC |
2 ms |
256 KB |
subtask0_12.txt |
AC |
2 ms |
256 KB |
subtask0_13.txt |
AC |
2 ms |
256 KB |
subtask0_14.txt |
AC |
2 ms |
256 KB |
subtask0_2.txt |
AC |
2 ms |
256 KB |
subtask0_3.txt |
AC |
2 ms |
256 KB |
subtask0_4.txt |
AC |
2 ms |
256 KB |
subtask0_5.txt |
AC |
1 ms |
256 KB |
subtask0_6.txt |
AC |
1 ms |
256 KB |
subtask0_7.txt |
AC |
2 ms |
256 KB |
subtask0_8.txt |
AC |
1 ms |
256 KB |
subtask0_9.txt |
AC |
2 ms |
256 KB |
subtask1_0.txt |
AC |
24 ms |
896 KB |
subtask1_1.txt |
AC |
11 ms |
512 KB |
subtask1_10.txt |
AC |
31 ms |
1024 KB |
subtask1_11.txt |
AC |
29 ms |
1024 KB |
subtask1_12.txt |
AC |
29 ms |
1024 KB |
subtask1_13.txt |
AC |
29 ms |
1024 KB |
subtask1_14.txt |
AC |
29 ms |
1024 KB |
subtask1_15.txt |
AC |
29 ms |
1024 KB |
subtask1_2.txt |
AC |
9 ms |
512 KB |
subtask1_3.txt |
AC |
19 ms |
768 KB |
subtask1_4.txt |
AC |
22 ms |
896 KB |
subtask1_5.txt |
AC |
21 ms |
768 KB |
subtask1_6.txt |
AC |
13 ms |
512 KB |
subtask1_7.txt |
AC |
26 ms |
896 KB |
subtask1_8.txt |
AC |
8 ms |
384 KB |
subtask1_9.txt |
AC |
4 ms |
384 KB |