oj.uz

Submission #347233

# Submission time Handle Problem Language Result Execution time Memory
347233 2021-01-12T11:42:46 Z BorisBarca Matching (CEOI11_mat) C++14
100 / 100
 1506 ms 60368 KB 
/*
$$$$$$$\                      $$\           $$$$$$$\
$$  __$$\                     \__|          $$  __$$\
$$ |  $$ | $$$$$$\   $$$$$$\  $$\  $$$$$$$\ $$ |  $$ | $$$$$$\   $$$$$$\   $$$$$$$\ $$$$$$\
$$$$$$$\ |$$  __$$\ $$  __$$\ $$ |$$  _____|$$$$$$$\ | \____$$\ $$  __$$\ $$  _____|\____$$\
$$  __$$\ $$ /  $$ |$$ |  \__|$$ |\$$$$$$\  $$  __$$\  $$$$$$$ |$$ |  \__|$$ /      $$$$$$$ |
$$ |  $$ |$$ |  $$ |$$ |      $$ | \____$$\ $$ |  $$ |$$  __$$ |$$ |      $$ |     $$  __$$ |
$$$$$$$  |\$$$$$$  |$$ |      $$ |$$$$$$$  |$$$$$$$  |\$$$$$$$ |$$ |      \$$$$$$$\\$$$$$$$ |
\_______/  \______/ \__|      \__|\_______/ \_______/  \_______|\__|       \_______|\_______|
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define PB push_back
#define MP make_pair
#define INS insert
#define LB lower_bound
#define UB upper_bound
#define pii pair <int,int>
#define pll pair <long long, long long>
#define X first
#define Y second
#define _ << " " <<
#define sz(x) (int)x.size()
#define all(a) (a).begin(),(a).end()
#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 FORA(i, x) for (auto &i : x)
#define REP(i, n) FOR(i, 0, n)
#define BITS(x) __builtin_popcount(x)
#define SQ(a) (a) * (a)
#define TRACE(x) cout << #x " = " << (x) << '\n';
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define umap unordered_map

typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <pii> vpi;
typedef vector <ll> vll;
typedef vector <pll> vpl;
typedef vector <double> vd;
typedef vector <ld> vld;
typedef vector<string> vs;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
//find_by_order -> kti najmanji
//order_of_key -> koliko ima manjih od x
//((float) t)/CLOCKS_PER_SEC

const int MOD = 1e9 + 7;
const double PI = acos(-1);
const int INF = 1e9 + 10;
const ll INFL = 1e18 + 10;
const int ABC = 30;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dox[] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int doy[] = {0, 0, -1, 1, -1, 1, -1, 1};

inline int sum(int a, int b){
	if (a + b < 0)
		return (a + b + MOD) % MOD;
	return (a + b) % MOD;
}

inline void add(int &a, int b){
	a = sum(a, b);
}

inline int mul(ll a, ll b){
	return ((a % MOD) * ((ll)b % MOD)) % MOD;
}

inline int sub(int a, int b){
	return (a - b + MOD) % MOD;
}

inline int fast_pot(ll pot, ll n){
	ll ret = 1;
	while (n){
		if (n & 1LL)
			ret = (ret * pot) % MOD;
		pot = (pot * pot) % MOD;
		n >>= 1LL;
	}
	return ret;
}

inline int divide(int a, int b){
	return mul(a, fast_pot(b, MOD - 2));
}

ll lcm(ll a, ll b){
	return abs(a * b) / __gcd(a, b);
}

inline double ccw(pii A, pii B, pii C){
	return (A.X * B.Y) - (A.Y * B.X) + (B.X * C.Y) - (B.Y * C.X) + (C.X * A.Y) - (C.Y * A.X);
}

inline int CCW(pii A, pii B, pii C){
	double val = ccw(A, B, C);
	double eps = max(max(abs(A.X), abs(A.Y)), max(max(abs(B.X), abs(B.Y)), max(abs(C.X), abs(C.Y)))) / 1e9;
	if (val <= -eps)
		return -1;
	if (val >= eps)
		return 1;
	return 0;
}

void to_upper(string &x){
	REP(i, sz(x))
		x[i] = toupper(x[i]);
}

void to_lower(string &x){
	REP(i, sz(x))
		x[i] = tolower(x[i]);
}

string its(ll x){
	if (x == 0)
		return "0";
	string ret = "";
	while (x > 0){
		ret += (x % 10) + '0';
		x /= 10;
	}
	reverse(all(ret));
	return ret;
}

ll sti(string s){
	ll ret = 0;
	REP(i, sz(s)){
		ret *= 10;
		ret += (s[i] - '0');
	}
	return ret;
}

const int N = 1e6 + 10;
const int P = 101;
const int LOG = 20;
const int OFF = 1 << LOG;

int n, m, pot[N], a[N], b[N], ans[N], idx[N];

struct node{
	int cnt, p, h;
};

struct tournament{
	node t[3 * OFF];
	int off;

	void init(int n){
		for (off = 1; off < n; off *= 2);
		REP(i, 2 * OFF)
			t[i].cnt = t[i].p = t[i].h = 0;
	}

	void update(int x, int c, int p){
		t[x + off].cnt = c;
		t[x + off].p = p;
		t[x + off].h = 0;


		for (int i = (x + off) / 2; i; i /= 2){
			t[i].p = sum(t[i * 2].p, t[i * 2 + 1].p);
			t[i].h = sum(t[i * 2].h, t[i * 2 + 1].h);
			add(t[i].h, mul(t[i * 2 + 1].p, t[i * 2].cnt));
			t[i].cnt = sum(t[i * 2].cnt, t[i * 2 + 1].cnt);
		}
	}

} T;

int main () {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	pot[0] = 1;
	FOR(i, 1, N)
		pot[i] = mul(pot[i - 1], P);

	cin >> n >> m;
	int H = 0;
	REP(i, n){
		ll x; cin >> x;
		a[i] = x;
		ans[x - 1] = i;
	}

	REP(i, n){
		//cout << ans[i] << ' ';
		add(H, mul(pot[n - i - 1], ans[i]));
	}
	//cout << '\n';

	vll sor;
	REP(i, m){
		ll x; cin >> x;
		b[i] = x;
		sor.PB(x);
	}
	sort(all(sor));

	REP(i, m){
		auto it = LB(all(sor), b[i]) - sor.begin();
		b[i] = it;
	}

	T.init(m);
	REP(i, n)
		T.update(b[i], 1, pot[m - i - 1]);

	vi sol;
	REP(i, (m - n) + 1){
		//cout << i _ pomH[i] << '\n';
		//cout << (mul(pomH[i], H) == T.t[1].h) << '\n';
		if (mul(pot[(m - n) - i], H) == T.t[1].h){
			//cout << "da tako je\n"; 
			//cout << "dodajem jebeni" _ i <<'\n';
			sol.PB(i);
		}
		T.update(b[i], 0, 0);
		T.update(b[i + n], 1, pot[m - (i + n) - 1]);
	}

	cout << sz(sol) << '\n';
	FORA(x, sol)
		cout << x + 1 << ' ';
	cout << '\n';
	
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 29036 KB Output is correct
2 Correct 29 ms 28908 KB Output is correct
3 Correct 29 ms 28908 KB Output is correct
4 Correct 29 ms 28908 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 28928 KB Output is correct
2 Correct 30 ms 28908 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 29424 KB Output is correct
2 Correct 42 ms 29296 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 29424 KB Output is correct
2 Correct 44 ms 29296 KB Output is correct
3 Correct 31 ms 29036 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 31588 KB Output is correct
2 Correct 184 ms 31460 KB Output is correct
3 Correct 242 ms 31832 KB Output is correct
4 Correct 240 ms 31844 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 32100 KB Output is correct
2 Correct 257 ms 31460 KB Output is correct
3 Correct 199 ms 31716 KB Output is correct
4 Correct 205 ms 34404 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 32228 KB Output is correct
2 Correct 188 ms 31716 KB Output is correct
3 Correct 204 ms 31588 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 978 ms 43344 KB Output is correct
2 Correct 1311 ms 53200 KB Output is correct
3 Correct 1031 ms 42832 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 882 ms 42704 KB Output is correct
2 Correct 1506 ms 45392 KB Output is correct
3 Correct 1319 ms 52720 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1022 ms 42388 KB Output is correct
2 Correct 971 ms 60368 KB Output is correct
3 Correct 1150 ms 45648 KB Output is correct
4 Correct 698 ms 53092 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 962 ms 43140 KB Output is correct
2 Correct 1043 ms 45904 KB Output is correct
3 Correct 440 ms 40072 KB Output is correct
4 Correct 791 ms 52436 KB Output is correct