97922024-03-06 22:39:28SleepyOverlordKörJáték (50 pont)cpp17Time limit exceeded 25/50573ms3624 KiB
#include <vector>
#include <string> 
#include <set> 
#include <map> 
#include <unordered_set>
#include <unordered_map>
#include <queue> 
#include <bitset> 
#include <stack>
#include <list>

#include <numeric> 
#include <algorithm> 
#include <random>
#include <chrono>

#include <cstdio>
#include <fstream>
#include <iostream> 
#include <sstream> 
#include <iomanip>
#include <climits>

#include <cctype>
#include <cmath> 
#include <ctime>
#include <cassert>

using namespace std;

#define ULL unsigned long long
#define LL long long
#define PII pair <int, int>
#define VB vector <bool>
#define VI vector <int>
#define VLL vector <LL>
#define VD vector <double>
#define VS vector <string>
#define VPII vector <pair <int, int> >
#define VVI vector < VI >
#define VVB vector < VB >
#define SI set < int >
#define USI unordered_set <int>
#define MII map <int, int>
#define UMII unordered_map <int, int>
#define MS multiset
#define US unordered_set
#define UM unordered_map
#define UMS unordered_multiset
#define UMM unordered_multimap

#define FORN(i, n) for(int i = 0; i < (n); ++i)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define MX(x, y) x = max(x, y);
#define MN(x, y) x = min(x, y);

#define SZ size()
#define BG begin() 
#define EN end() 
#define CL clear()
#define X first
#define Y second
#define RS resize
#define PB push_back
#define MP make_pair
#define ALL(x) x.begin(), x.end()
#define INS insert
#define ER erase
#define CNT count

template <class T> ostream& operator <<(ostream & os, const vector<T> &vec)
{
	for (int i = 0; i < vec.size() - 1; ++i) os << vec[i] << ' ';
	return os << vec[vec.size() - 1];
}

template <class T1, class T2> ostream& operator <<(ostream & os, const pair<T1, T2> &p)
{
	return os << p.X << " " << p.Y;
}

template <typename T>
void pr(T var1)
{
	cout << var1 << '\n';
}
template <typename T, typename... Types>
void pr(T var1, Types... var2)
{
	cout << var1;
	pr(var2...);
}

void in(int &n, VI &a) //array of ints
{
	cin >> n;
	a.CL, a.RS(n + 1);
	FOR(i, 1, n) cin >> a[i];
}

void in(int &n, VS &a) //array of strings
{
	cin >> n;
	a.CL, a.RS(n + 1);
	FOR(i, 1, n) cin >> a[i];
}

void in(int &n, VPII &a) //array of pairs
{
	cin >> n;
	a.CL, a.RS(n + 1);
	FOR(i, 1, n) cin >> a[i].X >> a[i].Y;
}

void in(int &n, int &m, VVI &g) //unweighted graph
{
	cin >> n >> m;
	g.CL, g.RS(n + 1);
	FOR(i, 1, n)
	{
		int x, y;
		cin >> x >> y;
		g[x].PB(y);
		g[y].PB(x);
	}
}

void in(int &n, VVI &g) //unweighted tree
{
	cin >> n;
	g.CL, g.RS(n + 1);
	FOR(i, 1, n - 1)
	{
		int x, y;
		cin >> x >> y;
		g[x].PB(y);
		g[y].PB(x);
	}
}

void in(int &n, int &m, vector <VPII> &g) //weighted graph
{
	cin >> n >> m;
	g.CL, g.RS(n + 1);
	FOR(i, 1, n)
	{
		int x, y, z;
		cin >> x >> y >> z;
		g[x].PB({y, z});
		g[y].PB({x, z});
	}
}

void in(int &n, vector <VPII> &g) //weighted tree
{
	cin >> n;
	g.CL, g.RS(n + 1);
	FOR(i, 1, n - 1)
	{
		int x, y, z;
		cin >> x >> y >> z;
		g[x].PB({y, z});
		g[y].PB({x, z});
	}
}

int n;
VI a, b, poz;

int main()
{
	#ifdef AT_HOME
	freopen("a.in", "r", stdin);
	freopen("a.out", "w", stdout);
	#endif

	in(n, a);
	poz.RS(n + 1);
	FOR(i, 1, n) poz[a[i]] = i;
	b = a;
	FOR(i, 1, n)
	{
		a[i] = n + 1;

		int sum = 0;
		FORD(jj, n, 1)
		{
			int j = poz[jj];
			if (a[j] == n + 1 or a[j] == 0) continue;
			int k = j + 1;
			while (k < n and a[k] < b[j]) ++k;
			if (k > n or a[k] < a[j])
			{
				k = 1;
				while (a[k] < b[j]) ++k;
				sum += n + k - j;
			}
			else sum += k - j;
			a[k] = 0;
		}
		cout << sum << " ";

		a = b;
	}

	return 0;
}
SubtaskSumTestVerdictTimeMemory
base25/50
1Accepted0/03ms2152 KiB
2Accepted0/03ms2292 KiB
3Accepted0/03ms2456 KiB
4Accepted2/22ms2364 KiB
5Accepted2/23ms2488 KiB
6Accepted2/23ms2696 KiB
7Accepted2/23ms2916 KiB
8Accepted2/23ms3124 KiB
9Accepted2/23ms3300 KiB
10Accepted2/23ms3552 KiB
11Accepted2/23ms3592 KiB
12Accepted2/23ms3596 KiB
13Accepted2/23ms3624 KiB
14Accepted2/23ms3596 KiB
15Accepted2/23ms3596 KiB
16Accepted1/13ms3596 KiB
17Time limit exceeded0/2554ms3264 KiB
18Time limit exceeded0/2573ms3276 KiB
19Time limit exceeded0/2545ms3236 KiB
20Time limit exceeded0/2564ms3188 KiB
21Time limit exceeded0/2560ms3264 KiB
22Time limit exceeded0/2546ms3260 KiB
23Time limit exceeded0/2560ms3236 KiB
24Time limit exceeded0/2549ms3256 KiB
25Time limit exceeded0/2560ms3372 KiB
26Time limit exceeded0/2569ms3236 KiB
27Time limit exceeded0/2564ms3192 KiB
28Time limit exceeded0/2541ms3288 KiB
29Time limit exceeded0/1569ms3260 KiB