oj.uz

Submission #640283

# Submission time Handle Problem Language Result Execution time Memory
640283 2022-09-14T05:45:43 Z IWTIM Vođe (COCI17_vode) C++17
120 / 120
 562 ms 192576 KB 
#include <bits/stdc++.h>
	using namespace std;
using ll = long long;
using db = long double;	// or double, if TL is tight
using str = string;	// yay python! 

// pairs
using pii = pair<int, int> ;
using pl = pair<ll, ll> ;
using pd = pair<db, db> ;

#define mp make_pair
#define f first
#define s second
#define tcT template < class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT > using V = vector<T> ;
tcT, size_t SZ > using AR = array<T, SZ> ;
using vi = V<int> ;
using vb = V<bool> ;
using vl = V<ll> ;
using vd = V<db> ;
using vs = V<str> ;
using vpi = V<pii> ;
using vpl = V<pl> ;
using vpd = V<pd> ;

// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define rep(a) F0R(_, a)
#define each(a, x) for (auto &a: x)
	const int MOD = 998244353;
const int MX = 5005;
const ll BIG = 1e18;	// not too close to LLONG_MAX
const db PI = acos((db) - 1);
const int dx[4]
{
	1, 0, -1, 0
}, dy[4]
{
	0, 1, 0, -1
};	// for every grid problem!!
mt19937 rng((uint32_t) chrono::steady_clock::now().time_since_epoch().count());
template < class T > using pqg = priority_queue<T, vector < T>, greater < T>> ;
struct DSU
{
	vi e;
	void init(int N)
	{
		e = vi(N, -1);
	}

	int get(int x)
	{
		return e[x] < 0 ? x : e[x] = get(e[x]);
	}

	bool sameSet(int a, int b)
	{
		return get(a) == get(b);
	}

	int size(int x)
	{
		return -e[get(x)];
	}

	bool unite(int x, int y)
	{
		// union by size
		x = get(x), y = get(y);
		if (x == y) return 0;
		if (e[x] > e[y]) swap(x, y);
		e[x] += e[y];
		e[y] = x;
		return 1;
	}
};
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void > struct is_iterable : false_type {};
	tcT > struct is_iterable<T, void_t<decltype(begin(declval < T>())),
	                                  decltype(end(declval < T>()))
	                                 >
	                       > : true_type {};
	tcT > constexpr bool is_iterable_v = is_iterable<T>::value;

	//////////// is_readable
	tcT, class = void > struct is_readable : false_type {};
	tcT > struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v < decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT > constexpr bool is_readable_v = is_readable<T>::value;

	//////////// is_printable
	//	// https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void > struct is_printable : false_type {};
	tcT > struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v < decltype(cout <<declval < T>()), ostream&>
	        >
	    > : true_type {};
	tcT > constexpr bool is_printable_v = is_printable<T>::value;
}*/
using ll = long long;
using db = long double;	// or double, if TL is tight
using str = string;	// yay python! 

// pairs
using pii = pair<int, int> ;
using pl = pair<ll, ll> ;
using pd = pair<db, db> ;

#define mp make_pair
#define f first
#define s second
#define tcT template < class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT > using V = vector<T> ;
tcT, size_t SZ > using AR = array<T, SZ> ;
using vi = V<int> ;
using vb = V<bool> ;
using vl = V<ll> ;
using vd = V<db> ;
using vs = V<str> ;
using vpi = V<pii> ;
using vpl = V<pl> ;
using vpd = V<pd> ;

// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define rep(a) F0R(_, a)
#define each(a, x) for (auto &a: x)
	template < class T > using pqg = priority_queue<T, vector < T>, greater < T>> ;

/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void > struct is_iterable : false_type {};
	tcT > struct is_iterable<T, void_t<decltype(begin(declval < T>())),
	                                  decltype(end(declval < T>()))
	                                 >
	                       > : true_type {};
	tcT > constexpr bool is_iterable_v = is_iterable<T>::value;

	//////////// is_readable
	tcT, class = void > struct is_readable : false_type {};
	tcT > struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v < decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT > constexpr bool is_readable_v = is_readable<T>::value;

	//////////// is_printable
	//	// https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void > struct is_printable : false_type {};
	tcT > struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v < decltype(cout <<declval < T>()), ostream&>
	        >
	    > : true_type {};
	tcT > constexpr bool is_printable_v = is_printable<T>::value;
}*/
int t, n, m, k, a[MX], dp[MX][MX], sf[MX][MX];
main()
{
	ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
	}

	a[n + 1] = a[1];
	for (int j = m - 1; j >= 0; j--)
	{
		for (int i = 1; i <= n; i++)
		{
			sf[i][j] = sf[i][j + 1];
			if (j == m - 1)
			{
				dp[i][j] = 0;
				continue;
			}

			if (a[i] == a[i + 1])
			{
				if (sf[i % n + 1][j + 1] - sf[i % n + 1][min(j + k, m - 1) + 1]) dp[i][j] = 1, sf[i][j]++;

			}
			else
			{
				if (j != m - 1 && j + k >= m) dp[i][j] = 1, sf[i][j]++;
				else if ((sf[i % n + 1][j + 1] - sf[i % n + 1][min(j + k, m - 1) + 1]) != min(j + k, m - 1) - j) dp[i][j] = 1, sf[i][j]++;
			}
		}
	}

	for (int i = 1; i <= n; i++)
	{
		if (dp[i][0]) cout << a[i] << " ";
		else cout << !a[i] << " ";
	}
}

/*
2 9 2
0 1
*/

Compilation message

vode.cpp:209:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  209 | main()
      | ^~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 712 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2260 KB Output is correct
2 Correct 1 ms 1236 KB Output is correct
3 Correct 2 ms 2260 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2388 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3668 KB Output is correct
2 Correct 3 ms 4308 KB Output is correct
3 Correct 3 ms 4180 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5452 KB Output is correct
2 Correct 4 ms 5204 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4820 KB Output is correct
2 Correct 4 ms 5076 KB Output is correct
3 Correct 0 ms 340 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 35756 KB Output is correct
2 Correct 75 ms 38180 KB Output is correct
3 Correct 504 ms 170140 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 69708 KB Output is correct
2 Correct 442 ms 168688 KB Output is correct
3 Correct 133 ms 78660 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 494 ms 171384 KB Output is correct
2 Correct 5 ms 4180 KB Output is correct
3 Correct 2 ms 2892 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 501 ms 172284 KB Output is correct
2 Correct 383 ms 183028 KB Output is correct
3 Correct 562 ms 192576 KB Output is correct