Submission 1084 | MatCom Online Grader

Id	Date	User	Problem	Result	Time	Mem	Lang
1084	20/05/2013 15:13:07	otero1991	C - Cola de Coppelia	Accepted	203	1.4 KiB	GNU G++ 5.1.0

Code

#include <cstdio>
#include <sstream>
#include <iostream>

#include <set>
#include <map>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <complex>
#include <cstring>
#include <stack>
#include <ctime>
#include <cmath>
#include <cstdlib>
#include <algorithm>
using namespace std;

#define FOR(i,n) for (int i = 1; i <= (n); ++i)
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define REPI(i,c) for (typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
#define ALL(c) c.begin(), c.end()
#define SZ(x) ((int)(x).size())
#define MP make_pair

#define DB(x) cout << #x << " = " << x << endl;
#define CK(x) if(!(x)) cout << '(' << #x << ") is false!!!" << endl;

typedef long long int64;
typedef unsigned long long uint64;
typedef complex<int> point;
typedef pair<int, int> pii;
typedef vector<int> vi;

const int INF = 1 << 30;
const double EPS = 1e-7;

int main()
{
	ios::sync_with_stdio(false);
	int64 ans = 0;
	stack<pii> st;
	int n; cin>>n;
	int x;
	for(int i = 0; i < n; i++)
	{
		cin>>x;
		int c = 1;
		while(!st.empty() && x > st.top().first)
		{
			ans+=st.top().second;
			st.pop();
		}
		if(!st.empty() && st.top().first == x)
		{
			c += st.top().second;
			st.pop();
		}
		ans += c-1;
		if(!st.empty()) ans++;
		st.push(make_pair(x,c));
	}
	cout<<ans<<endl;
    return 0;
}// UH++

Judgement Details

Test 01: 0.010 0.000 1400K ok
Test 02: 0.009 0.000 1416K ok
Test 03: 0.233 0.094 1416K ok
Test 04: 0.008 0.000 1416K ok
Test 05: 0.011 0.016 1420K ok
Test 06: 0.057 0.031 1416K ok
Test 07: 0.065 0.047 1416K ok
Test 08: 0.125 0.094 1416K ok
Test 09: 0.161 0.078 1416K ok
Test 10: 0.221 0.140 1420K ok
Test 11: 0.282 0.203 1420K ok
Accepted

Matcom Online Grader