Submission #813659
Source Code Expand
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cassert>
using namespace std;
#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,REP3,REP2) (__VA_ARGS__)
#define RREP3(i,s,e) for (i = s; i >= e; i--)
#define RREP2(i,n) RREP3 (i,(int)(n)-1,0)
#define RREP(...) GET_ARG (__VA_ARGS__,RREP3,RREP2) (__VA_ARGS__)
#define DEBUG(x) cerr << #x ": " << x << endl
typedef long long ll;
constexpr int INF = 1e8;
constexpr int MOD = 1e9+7;
constexpr int ESP = 1e-9;
constexpr double PI = acos(-1);
int a[100000];
int main(void) {
int i, n;
scanf("%d",&n);
REP (i,n) scanf("%d",&a[i]);
ll ans = n;
int cnt = 0;
REP (i,1,n-1) {
if (a[i-1] < a[i])
cnt++;
else
cnt = 0;
ans += cnt;
}
printf("%lld\n",ans);
return 0;
}
Submission Info
| Submission Time |
|
| Task |
C - 単調増加 |
| User |
hiroki015 |
| Language |
C++14 (GCC 5.4.1) |
| Score |
100 |
| Code Size |
1027 Byte |
| Status |
AC |
| Exec Time |
21 ms |
| Memory |
640 KiB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:31:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:32:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP (i,n) scanf("%d",&a[i]);
^
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 |
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 |
4 ms |
256 KiB |
| sample1.txt |
AC |
4 ms |
256 KiB |
| sample2.txt |
AC |
4 ms |
256 KiB |
| sample3.txt |
AC |
4 ms |
256 KiB |
| subtask0_0.txt |
AC |
4 ms |
256 KiB |
| subtask0_1.txt |
AC |
4 ms |
256 KiB |
| subtask0_10.txt |
AC |
4 ms |
256 KiB |
| subtask0_11.txt |
AC |
4 ms |
256 KiB |
| subtask0_12.txt |
AC |
4 ms |
256 KiB |
| subtask0_13.txt |
AC |
4 ms |
256 KiB |
| subtask0_14.txt |
AC |
4 ms |
256 KiB |
| subtask0_2.txt |
AC |
4 ms |
256 KiB |
| subtask0_3.txt |
AC |
4 ms |
256 KiB |
| subtask0_4.txt |
AC |
4 ms |
256 KiB |
| subtask0_5.txt |
AC |
4 ms |
256 KiB |
| subtask0_6.txt |
AC |
4 ms |
256 KiB |
| subtask0_7.txt |
AC |
4 ms |
256 KiB |
| subtask0_8.txt |
AC |
4 ms |
256 KiB |
| subtask0_9.txt |
AC |
4 ms |
256 KiB |
| subtask1_0.txt |
AC |
18 ms |
512 KiB |
| subtask1_1.txt |
AC |
10 ms |
384 KiB |
| subtask1_10.txt |
AC |
21 ms |
640 KiB |
| subtask1_11.txt |
AC |
21 ms |
640 KiB |
| subtask1_12.txt |
AC |
20 ms |
640 KiB |
| subtask1_13.txt |
AC |
21 ms |
640 KiB |
| subtask1_14.txt |
AC |
20 ms |
640 KiB |
| subtask1_15.txt |
AC |
21 ms |
640 KiB |
| subtask1_2.txt |
AC |
9 ms |
384 KiB |
| subtask1_3.txt |
AC |
15 ms |
512 KiB |
| subtask1_4.txt |
AC |
16 ms |
512 KiB |
| subtask1_5.txt |
AC |
16 ms |
512 KiB |
| subtask1_6.txt |
AC |
11 ms |
384 KiB |
| subtask1_7.txt |
AC |
19 ms |
640 KiB |
| subtask1_8.txt |
AC |
8 ms |
384 KiB |
| subtask1_9.txt |
AC |
6 ms |
256 KiB |