2. 程式人生 > >Atcoder Grand Contest 003 題解

Atcoder Grand Contest 003 題解

阿新 • • 發佈：2018-09-08
位置 發現 clu cpp 模擬 gii icu define -a

A - Wanna go back home

如果有S就必須要有N，反之亦然，如果有E必須要有W，反之亦然。判斷一下就好了。

//waz
#include <bits/stdc++.h>

using namespace std;

#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)((x).size()))

typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long int64;
typedef unsigned int uint;
typedef unsigned long long uint64;

#define gi(x) ((x) = F())
#define gii(x, y) (gi(x), gi(y))
#define giii(x, y, z) (gii(x, y), gi(z))

int F()
{
	char ch;
	int x, a;
	while (ch = getchar(), (ch < ‘0‘ || ch > ‘9‘) && ch != ‘-‘);
	if (ch == ‘-‘) ch = getchar(), a = -1;
	else a = 1;
	x = ch - ‘0‘;
	while (ch = getchar(), ch >= ‘0‘ && ch <= ‘9‘)
		x = (x << 1) + (x << 3) + ch - ‘0‘;
	return a * x;
}

int n;
char str[2333];
bool t[4];

int main()
{
	scanf("%s", str + 1); n = strlen(str + 1);
	for (int i = 1; i <= n; ++i)
	{
		if (str[i] == ‘W‘) t[0] = 1;
		if (str[i] == ‘E‘) t[1] = 1;
		if (str[i] == ‘N‘) t[2] = 1;
		if (str[i] == ‘S‘) t[3] = 1;
	}
	puts(t[0] == t[1] && t[2] == t[3] ? "Yes" : "No");
}

　　

B - Simplified mahjong

先O(n)掃一遍，把奇數的能刪就刪去一個。最後每個除以二再求和就好了。

//waz
#include <bits/stdc++.h>

using namespace std;

#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)((x).size()))

typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long int64;
typedef unsigned int uint;
typedef unsigned long long uint64;

#define gi(x) ((x) = F())
#define gii(x, y) (gi(x), gi(y))
#define giii(x, y, z) (gii(x, y), gi(z))

int F()
{
	char ch;
	int x, a;
	while (ch = getchar(), (ch < ‘0‘ || ch > ‘9‘) && ch != ‘-‘);
	if (ch == ‘-‘) ch = getchar(), a = -1;
	else a = 1;
	x = ch - ‘0‘;
	while (ch = getchar(), ch >= ‘0‘ && ch <= ‘9‘)
		x = (x << 1) + (x << 3) + ch - ‘0‘;
	return a * x;
}

int n, a[100010];

long long ans;

int main()
{
	gi(n);
	for (int i = 1; i <= n; ++i) gi(a[i]);
	for (int i = 1; i <= n; ++i)
	{
		if (a[i] & 1)
		{
			if (a[i + 1]) ++ans, --a[i], --a[i + 1];
		}
	}
	for (int i = 1; i <= n; ++i)
	{
		ans += a[i] >> 1;
	}
	printf("%lld\n", ans);
	return 0;
}

　　

C - BBuBBBlesort!

我們發現操作2使得奇數偶數獨立，我們只要算應該在奇數位置最後到偶數位置的數有多少個就好了。

//waz
#include <bits/stdc++.h>

using namespace std;

#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)((x).size()))

typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long int64;
typedef unsigned int uint;
typedef unsigned long long uint64;

#define gi(x) ((x) = F())
#define gii(x, y) (gi(x), gi(y))
#define giii(x, y, z) (gii(x, y), gi(z))

int F()
{
	char ch;
	int x, a;
	while (ch = getchar(), (ch < ‘0‘ || ch > ‘9‘) && ch != ‘-‘);
	if (ch == ‘-‘) ch = getchar(), a = -1;
	else a = 1;
	x = ch - ‘0‘;
	while (ch = getchar(), ch >= ‘0‘ && ch <= ‘9‘)
		x = (x << 1) + (x << 3) + ch - ‘0‘;
	return a * x;
}

int n;

PII a[100010];

int main()
{
	gi(n);
	for (int i = 1; i <= n; ++i) gi(a[i].fi), a[i].se = i;
	sort(a + 1, a + n + 1);
	int ans = 0;
	for (int i = 1; i <= n; ++i) if ((a[i].se & 1) != (i & 1)) ++ans;
	printf("%d\n", ans >> 1);
	return 0;
}

　　

D - Anticube

首先因子裏有立方的可以直接除掉，不會有影響，那麽一個數對應的就是唯一的，篩法找出那個數字，算一下就好了。

//waz
#include <bits/stdc++.h>

using namespace std;

#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)((x).size()))

typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long int64;
typedef unsigned int uint;
typedef unsigned long long uint64;

#define gi(x) ((x) = F())
#define gii(x, y) (gi(x), gi(y))
#define giii(x, y, z) (gii(x, y), gi(z))

int F()
{
	char ch;
	int x, a;
	while (ch = getchar(), (ch < ‘0‘ || ch > ‘9‘) && ch != ‘-‘);
	if (ch == ‘-‘) ch = getchar(), a = -1;
	else a = 1;
	x = ch - ‘0‘;
	while (ch = getchar(), ch >= ‘0‘ && ch <= ‘9‘)
		x = (x << 1) + (x << 3) + ch - ‘0‘;
	return a * x;
}

int n;

long long s[100010];

map<long long, int> h, t;

int p[3010], fg[3010], pt;

int main()
{
	gi(n);
	for (int i = 1; i <= n; ++i) scanf("%lld", s + i);
	for (int i = 2; i <= 3000; fg[i] ? : p[++pt] = i, ++i)
		for (int j = i << 1; j <= 3000; j += i)
			fg[j] = 1;
	long long mx = 0;
	for (int i = 1; i <= n; ++i)
	{
		for (int j = 1; 1LL * p[j] * p[j] * p[j] <= s[i]; ++j)
		{
			long long t = 1LL * p[j] * p[j] * p[j];
			while (!(s[i] % t)) s[i] /= t;
		}
		++h[s[i]];
		mx = max(mx, s[i]);
		//cerr << "s = " << s[i] << endl;
	}
	int ans = 0;
	t = h;
	for (auto iter : t)
	{
		long long x = iter.first;
		if (x == 1) continue;
		long long y = 1;
		for (int j = 1; j <= pt; ++j)
		{
			int cnt = 0;
			while (!(x % p[j])) x /= p[j], ++cnt;
			if (cnt == 1) y *= p[j] * p[j];
			else if (cnt == 2) y *= p[j];
		}
		if (x != 1)
		{
			long long s = sqrt(x);
			if (x == s * s)
				y *= s;
			else 
				y *= x * x;
		}
		//cerr << iter.first << ", " << y << ", " << x << endl;
		if(!h.count(y) || iter.first < y) ans += max(iter.second, h.count(y) ? h[y] : 0);
	}
	if (h[1]) ++ans;
	printf("%d\n", ans);
	return 0;
}

　　

E - Sequential operations on Sequence

倒著模擬，首先qi變成單調上升的，就可以二分了。

//waz
#include <bits/stdc++.h>

using namespace std;

#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)((x).size()))

typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long int64;
typedef unsigned int uint;
typedef unsigned long long uint64;

#define gi(x) ((x) = F())
#define gii(x, y) (gi(x), gi(y))
#define giii(x, y, z) (gii(x, y), gi(z))

int F()
{
	char ch;
	int x, a;
	while (ch = getchar(), (ch < ‘0‘ || ch > ‘9‘) && ch != ‘-‘);
	if (ch == ‘-‘) ch = getchar(), a = -1;
	else a = 1;
	x = ch - ‘0‘;
	while (ch = getchar(), ch >= ‘0‘ && ch <= ‘9‘)
		x = (x << 1) + (x << 3) + ch - ‘0‘;
	return a * x;
}

const int N = 1e5 + 10;

int n, Q, m;

long long q[N], t[N], s[N];

int find(long long k, int n)
{
	int t = 0;
	for (int i = 19; ~i; --i)
	{
		if (t + (1 << i) > n) continue;
		if (q[t + (1 << i)] <= k) t += 1 << i;
	}
	return t;
}

int main()
{
	gii(n, Q);
	q[++m] = n;
	for (int i = 1; i <= Q; ++i)
	{
		long long x;
		scanf("%lld", &x);
		while (x <= q[m]) --m;
		q[++m] = x;
	}
	t[m] = 1;
	for (int i = m; i; --i)
	{
		long long k = q[i];
		int p = find(k, i - 1);
		while (p)
		{
			t[p] += (k / q[p]) * t[i];
			k %= q[p];
			p = find(k, p - 1);
		}
		s[1] += t[i], s[k + 1] -= t[i];
	}
	long long ans = 0;
	for (int i = 1; i <= n; ++i) ans += s[i], printf("%lld\n", ans);
	return 0;
}

　　

F - Fraction of Fractal

首先考慮行有連接列也有連接的，那麽連通塊個數肯定為1，都沒有連接就是黑格子個數的K-1次方，只有一邊連接，假設是行，從K拓展到K+1的時候，公式：K+1層的連通塊個數=K層的黑格子個數-K層的左右格子對，因為上下不會擴展，所以只要減去左右，那麽我們就要維護黑格子個數和左右相連的格子有多少個，還要再維護邊界有多少相鄰，才能轉移。

x‘ = x^2（黑格子個數）

y‘ = z * y + x * y（左右相連格子個數）

z‘ = z * z（邊界相鄰格子數）

矩陣乘法計算就好了。

//waz
#include <bits/stdc++.h>

using namespace std;

#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)((x).size()))

typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long int64;
typedef unsigned int uint;
typedef unsigned long long uint64;

#define gi(x) ((x) = F())
#define gii(x, y) (gi(x), gi(y))
#define giii(x, y, z) (gii(x, y), gi(z))

int F()
{
	char ch;
	int x, a;
	while (ch = getchar(), (ch < ‘0‘ || ch > ‘9‘) && ch != ‘-‘);
	if (ch == ‘-‘) ch = getchar(), a = -1;
	else a = 1;
	x = ch - ‘0‘;
	while (ch = getchar(), ch >= ‘0‘ && ch <= ‘9‘)
		x = (x << 1) + (x << 3) + ch - ‘0‘;
	return a * x;
}

const int mod = 1e9 + 7;

struct matrix
{
	int a[2][2];
	matrix operator * (matrix that) 
	{
		matrix ans;
		memset(ans.a, 0, sizeof ans.a);
		for (int i = 0; i < 2; ++i)
			for (int j = 0; j < 2; ++j)
				for (int k = 0; k < 2; ++k)
					ans.a[i][j] = (ans.a[i][j] + 1LL * a[i][k] * that.a[k][j]) % mod;
		return ans;
	}
} w;

int fpow(int a, long long x)
{
	int ret = 1;
	for (; x; x >>= 1)
	{
		if (x & 1) ret = 1LL * ret * a % mod;
		a = 1LL * a * a % mod;
	}
	return ret;
}

matrix fpow(matrix a, long long x)
{
	matrix ret;
	memset(ret.a, 0, sizeof ret.a);
	ret.a[0][0] = ret.a[1][1] = 1;
	for (; x; x >>= 1)
	{
		if (x & 1) ret = ret * a;
		a = a * a;
	}
	return ret;
}

int H, W;

long long K;

char str[1010][1010];

int main()
{
	scanf("%d%d%lld", &H, &W, &K);
	for (int i = 1; i <= H; ++i)
		scanf("%s", str[i] + 1);
	int cntH = 0, cntW = 0;
	for (int i = 1; i <= H; ++i)
		if (str[i][1] == str[i][W] && str[i][1] == ‘#‘) ++cntH;
	for (int i = 1; i <= W; ++i)
		if (str[1][i] == str[H][i] && str[1][i] == ‘#‘) ++cntW;
	int cnt = 0;
	for (int i = 1; i <= H; ++i)
		for (int j = 1; j <= W; ++j)
			if (str[i][j] == ‘#‘) ++cnt;
	if (!cntH && !cntW)
	{
		printf("%d\n", fpow(cnt, K - 1));
		return 0;
	}
	if ((cntH && cntW) || !K)
	{
		puts("1");
		return 0;
	}
	if (cntH)
	{
		w.a[0][0] = cnt;
		for (int i = 1; i <= H; ++i)
			for (int j = 1; j < W; ++j)
				if (str[i][j] == ‘#‘ && str[i][j + 1] == ‘#‘)
					++w.a[0][1];
		w.a[1][1] = cntH;
	}
	else
	{
		w.a[0][0] = cnt;
		for (int i = 1; i < H; ++i)
			for (int j = 1; j <= W; ++j)
				if (str[i][j] == ‘#‘ && str[i + 1][j] == ‘#‘)
					++w.a[0][1];
		w.a[1][1] = cntW;
	}
	w = fpow(w, K - 1);
	printf("%d\n", (w.a[0][0] - w.a[0][1] + mod) % mod);
	return 0;
}

　　

Atcoder Grand Contest 003 題解

相關推薦

Atcoder Grand Contest 003 題解

位置 發現 clu cpp 模擬 gii icu define -a A - Wanna go back home 如果有S就必須要有N，反之亦然，如果有E必須要有W，反之亦然。判斷一下就好了。 //waz #include <bits/stdc++.h>

Atcoder Grand Contest 002 題解

push_back 個人選擇 first box 可能 getc 等於 clear const A - Range Product 經過0答案肯定是0，都是正數肯定是正數，都是負數的話就奇負偶正。 //waz #include <bits/stdc++.h>

AtCoder Grand Contest 013 題解

fine esp square == ask air %d nis 就是 A - Sorted Arrays 貪心，看看不下降和不上升最長能到哪，直接轉移過去即可。 1 //waz 2 #include <bits/stdc++.h> 3 4 us

AtCoder Grand Contest 015 題解

pan gin ken -- 出現 style 地方 連通塊 發現 A - A+...+B Problem 可以取到的值一定是一段區間。所以答案即為max-min+1 1 //waz 2 #include <bits/stdc++.h> 3 4 u

[atcoder]AtCoder Grand Contest 027題解

【題目連結】 A 【題解】 題意： 是把xxx個糖果分給nnn個人，一個人如果恰好分到aia_{i}ai​個糖果就會高興。求最多使多少個人高興。 題解： 一定是優先滿足需求小的人，特判有額外的剩餘糖果。 時間複雜度：O(NlogN)O(NlogN)O(Nlog

Atcoder Grand Contest 021 題解

Problem A. （此處省略）反正怎麼搞都行了。。。 Problem B. 對於每個點，列舉其他點，那麼選的點一定是在垂直平分線的一側。由於R 特別大，所以可以把這個垂直平分線移到這個點上，就相當於一堆可行極角區間求交 也可以O(nlogn)，大概是把凸

AtCoder Grand Contest 031 簡要題解

isp href uil 出現 mat false tor 每次 spa AtCoder Grand Contest 031 Atcoder A - Colorful Subsequence description 求\(s\)中本質不同子序列的個數模\(10^9+7\)。

AtCoder Grand Contest 013D: Piling Up 題解

情況 之前 include out fin fine del ons etc 題意簡化: [luogu] Piling Up 一開始有n個顏色為黑白的球，但不知道黑白色分別有多少，m次操作，每次先拿出一個球，再放入黑白球各一個，再拿出一個球，最後拿出的球按順序排列會形成一個

AtCoder Grand Contest 020 C - Median Sum

CI https TE ems and fin sub oot tco 題目：here 題解：要轉化一下，找所有子集的中間值，等價於找一個子集，滿足這個子集的和最接近整個序列的和的一半。也就是一個背包判斷可行性的問題。重點來了，bitset優化，至於為什麽？我也不懂啊啊啊

[Atcoder Grand Contest 001] Tutorial

IV AI display aps span col tin lap nbsp Link: AGC001 傳送門 A: #include <bits/stdc++.h> using namespace std; long long res=0; int n

AtCoder Grand Contest 024 Problem E（動態規劃）

stand 之間 graph ret scan 慢慢 rap and there www.cnblogs.com/shaokele/ AtCoder Grand Contest 024 Problem E 　　Time Limit: 2 Sec 　　Memory Lim

AtCoder Grand Contest 006 F - Blackout

sin 所在 long long || 如果 open int 雙向 mem Description 在 \(n*n\) 的棋盤上給出 \(m\) 個黑點,若 \((x,y)\),\((y,z)\) 都是黑點,那麽 \((z,x)\) 也會變成黑點,求最後黑點的數量 題面

AtCoder Grand Contest #026 C - String Coloring

暴力 input 很好 left rgs map() paint int() letters Time Limit: 3 sec / Memory Limit: 1024 MB Score : 600600 points Problem Statement Y

AtCoder Grand Contest 007

mem ssi || 狀態 puts def end tor ace AtCoder Grand Contest 007 A - Shik and Stone 翻譯 見洛谷 題解 傻逼玩意 #include<cstdio> int n,m,tot;char ch

AtCoder Regular Contest 103 題解

print -s struct namespace type iostream con clas inline C-/\/\/\ #include<algorithm> #include<iostream> #include<cstdlib&g

AtCoder Grand Contest 011

判斷 define 開機 %s square d+ 更新 getc 在一起 AtCoder Grand Contest 011 upd:這篇咕了好久，前面幾題是三周以前寫的。。。 AtCoder Grand Contest 011 A - Airport Bus 翻譯 有\

AtCoder Grand Contest 001 C Shorten Diameter 樹的直徑

題意 給你一棵樹，每次可以刪除一個葉子節點，求最少需要多少次操作可以讓樹的直徑\(<=k,(n <= 2e3)\) 首先觀察資料範圍是可以接受\(O(n^2)\)的演算法的 我們考慮列舉每個點作為樹的根 統計這個點一定在直徑上時要刪多少點 如果\(k\)是偶數，那麼深度大於\(

AtCoder Grand Contest 006 C：Rabbit Exercise

題目傳送門：https://agc006.contest.atcoder.jp/tasks/agc006_c 題目翻譯 數軸上有\(N\)只兔子，從\(1\)到\(N\)編號，每隻兔子初始位置是\(x_i\)。現在兔子們要開始做運動，運動都有\(M\)個步驟，對於第\(i\)個步驟，我們用\(a_i\)來

AtCoder Grand Contest 014 E：Blue and Red Tree

make 開始 n-1 不可 task blog 應該 space find 題目傳送門：https://agc014.contest.atcoder.jp/tasks/agc014_e 題目翻譯 有一棵有\(N\)個點的樹，初始時每條邊都是藍色的，每次你可以選擇一條由藍色

AtCoder Grand Contest 012 D：Colorful Balls

題目傳送門：https://agc012.contest.atcoder.jp/tasks/agc012_d 題目翻譯 給你一排一共\(N\)個球，每個球有一個顏色\(c_i\)和一個重量\(w_i\)，如果兩個球顏色相同，重量相加不超過\(x\)那我就可以交換這倆個球的位置。如果兩個球顏色不同，重量相加