Submission #1276789

#	Time	Username	Problem	Language	Result	Execution time	Memory
1276789		Bui_Quoc_Cuong	Money (IZhO17_money)	C++20	0 / 100	1 ms	568 KiB

money

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<=(int)b;i++)
#define FORD(i,a,b) for(int i=a;i>=(int)b;i--)
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(a) a.begin(),a.end()
#define BIT(mask,i) ((mask>>(i))&1)
#define MASK(a) (1LL<=((a)))
#define uni(v) sort(all(v)); v.resize(unique(all(v)) - v.begin())
#define pii pair <int, int>
#define vi vector <int> 
#define vl vector <ll>
template <class A,class B>
bool maximize(A &a, const B b)
{
    if(a < b){ a = b; return 1;} return 0;
}
template <class A,class B>
bool minimize(A &a, const B b)
{
    if(a > b){ a = b; return 1;} return 0;
}
const int maxn = 1e6 + 5;

int n;
int a[maxn];

void solve()
{
	cin >> n;
	for(int i = 1; i <= n; i++)
		cin >> a[i];
	int last = - 1;
	int ans = 0;
	for(int i = 1; i <= n; i++)
	{
		if(last == - 1) 
		{
			ans++;
			last = a[i];
		} else if(a[i] >= last)
		{
			last = a[i];
		} else
		{
			ans++;
			last = a[i];
		}
	}
	cout << ans;
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);    
    #define kieuoanh "kieuoanh"
    if(fopen(kieuoanh".inp","r"))
    {
        freopen(kieuoanh".inp","r",stdin);
        freopen(kieuoanh".out","w",stdout);
    }
    int tst = 1; 
    // cin >> tst;
    while(tst--) solve();
    return 0;
}

Compilation message (stderr)

money.cpp: In function 'int main()':
money.cpp:63:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |         freopen(kieuoanh".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
money.cpp:64:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |         freopen(kieuoanh".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 20
• Subtask 4: 0 / 55