Submission #1222178


Source Code Expand

#include<bits/stdc++.h>
#include<unordered_map>
/*
*▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀
*    ▀▀       ▀▀▀▀▀▀    ▀     ▀▀▀▀▀▀      ▀    ▀
*   ▀  ▀      ▀         ▀     ▀            ▀  ▀
*  ▀    ▀     ▀ ▀ ▀     ▀     ▀ ▀ ▀         ▀
* ▀ ▀▀▀▀ ▀    ▀         ▀     ▀             ▀
*▀        ▀   ▀         ▀     ▀             ▀
*▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀
*/
using namespace std;
void afify()
{
    ios::sync_with_stdio(0);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
#define ll long
#define ld long double
#define loopi(i,intial,n)  for(ll i=ll(intial);i<n;i++)
#define loopj(j,intial,n) for(ll j=ll(intial);j<n;j++)
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define all(v) v.begin(),v.end()
///////////////////////////////////////
#define SCD(a) scanf("%d",&a)
#define SCD2(a,b) scanf("%d %d",&a,&b)
#define SCLL(a) scanf("%lld",&a)
#define SCLL2(a,b) scanf("%lld %lld",&a,&b)
#define PRD(a) printf("%d\n",a)
#define PRLL(a) printf("%lld\n",a)
///////////////////////////////////////
typedef vector <int> vi;
typedef vector <ll> vll;
typedef vector <vi> vvi;
typedef vector <vll> vvll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<vpii> vvpii;
typedef stringstream ss;
const ll oo = (ll) 1e13;
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
//ifstream ifs("input.txt");
//ofstream ofs("output.txt");
vll v;
int main()
{
   afify();
   int n;
   cin>>n;
   v.resize(n);
   loopi(i,0,n) cin>>v[i];
   bool test=0;ll res=0;
   loopi(i,0,n){
	   while (i+1<n&&v[i]<=v[i+1])
	   {
		   i++;test=1;
	   }
	   if(test){res++;test=0;}
	   while (i+1<n&&v[i]>=v[i+1])
	   {
		   i++;test=1;
	   }
	   if(test){res++;test=0;}

   }
   cout<<res<<endl;


	return 0; 
}

Submission Info

Submission Time
Task A - Sorted Arrays
User AFiFY
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2253 Byte
Status WA
Exec Time 11 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 10
WA × 7
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_01.txt WA 7 ms 768 KB
subtask_1_02.txt AC 6 ms 640 KB
subtask_1_03.txt WA 4 ms 512 KB
subtask_1_04.txt WA 11 ms 1024 KB
subtask_1_05.txt AC 11 ms 1024 KB
subtask_1_06.txt WA 11 ms 1024 KB
subtask_1_07.txt WA 11 ms 1024 KB
subtask_1_08.txt AC 11 ms 1024 KB
subtask_1_09.txt WA 11 ms 1024 KB
subtask_1_10.txt WA 1 ms 256 KB
subtask_1_11.txt AC 1 ms 256 KB