【ACM-ICPC】NEERC-2017(Clone Contest)

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
#include<bits/stdc++.h>
using namespace std;
#define REDIRECT

int main(){
	#ifdef REDIRECT
	freopen("auxiliary.in", "r", stdin);
	freopen("auxiliary.out", "w", stdout);
	#endif
	int n;
	cin >> n;
	switch(n%3){ // 3d + rem
		case 0:
		cout << n / 3 * 7 << endl;
		break;
		case 1:
		cout << (n/3-1)*7 + 4 << endl;
		break;
		case 2: // 2 5 8
		if(n == 2){
			cout << 1 << endl;
		}else{
			cout << n/3*7 + 1 << endl;	
		}		
		break;
	}
	return 0;
} 

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#include<bits/stdc++.h>
using namespace std;
#define REDIRECT

int main(){
	#ifdef REDIRECT
	freopen("kotlin.in", "r", stdin);
	freopen("kotlin.out", "w", stdout);
	#endif
	int h, w, n;
	cin >> h >> w >> n;
	int h1 = (h + 1) >> 1;
	int w1 = (w + 1) >> 1;
	auto check = [](int h, int w, int n){
		for (int i=1; i<=h; ++i){
			for (int j=1; j<=w; ++j){
				if(i * j == n) return make_pair(i, j);
			}
		}	
		return make_pair(0, 0);
	};
	auto res = check(h1, w1, n);
	if(res.first == 0){
		cout << "Impossible" << endl;
	}else{
		int &row = res.first, &col = res.second;
		// cout << row << " " << col << endl;
		vector<string> a(h, string(w, '.'));
		
		for (int i=1, cnt=0; i<h && cnt<row-1; i+=2, cnt++){
			a[i] = string(w, '#');
		}
		for (int j=1, cnt=0; j<w && cnt<col-1; j+=2, cnt++){
			for (int i=0; i<h; ++i){
				a[i][j] = '#';
			}
		}
		for (auto &s: a){
			for (auto &ch: s){
				cout << ch;
			}
			cout << endl;
		}
	}
	return 0;
} 

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include<bits/stdc++.h>
using namespace std;
#define REDIRECT

using LL = long long;
using pcb = pair<char, bool>;

int main(){
	#ifdef REDIRECT
	freopen("boolean.in", "r", stdin);
	freopen("boolean.out", "w", stdout);
	#endif
	string s;
	cin >> s;
	auto Split = [](const string &s){
		vector<pcb> ret;
		for (int i=0; i<(int)s.length(); ++i){
			if(s[i] == '~'){
				ret.emplace_back(make_pair(s[i+1], false));
				i++;
			}else if(s[i] != '|'){
				ret.emplace_back(make_pair(s[i], true));
			}
		}
		return ret;	
	};
	LL res = 0;
	vector<pcb> ret = Split(s);
	map<char, pair<bool, bool> > mp;
	for (auto &p: ret){
		if(p.second){ // pos
			mp[p.first].first = true;	
		}else{ // neg
			mp[p.first].second = true;
		}		
	}
	res = 1LL << (int)mp.size();
	bool flag = false;
	for (auto &p: mp){
		auto &rs = p.second;
		if(rs.first && rs.second){
			flag = true;
			break;
		}
	}
	if(!flag) res--;
	cout << res << endl;
	return 0;
} 

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include<bits/stdc++.h>
using namespace std;
#define REDIRECT

using LL = long long;
using pcb = pair<char, bool>;

const int maxn = 1000010;

char s[maxn];
map<char, int> adj[19];

char alpha[19] = {'b', 'c', 'd', 'f', 'g', 'h', 'j', 'k', 
'l', 'm', 'n', 'p', 'q', 'r', 's', 't', 'v', 'x', 'z'};

int pos[26] = {-1, 0, 1, 2, -1, 3, 4, 5, -1, 6, 7, 8, 9, 
10, -1, 11, 12, 13, 14, 15, -1, 16, -1, 17, -1, 18};

int main(){
	#ifdef REDIRECT
	freopen("consonant.in", "r", stdin);
	freopen("consonant.out", "w", stdout);
	#endif
	// freopen("genC.out", "r", stdin);
	scanf("%s", s);
	int n = strlen(s);	
	for (int i=0; i<n; ++i){
		if(pos[s[i]-'a'] != -1){
			if(i < n-1 && pos[s[i+1]-'a'] != -1){
				adj[pos[s[i]-'a']][s[i+1]]++;
				//cout << s[i] << " -> " << s[i+1] << endl;	
			}			
		}
	}
	/*
	for (int i=0; i<19; ++i){
		auto &mp = adj[i];		
		cout << alpha[i] << ": " << endl;
		for (auto& p: mp){			
			cout << p.first << "|= " << p.second << endl; 
		}
		cout << "================" << endl;
	}*/
	int maxn = 0, ans =0;
	for (int mask=1; mask<1<<19; ++mask){
		int cur = 0;
		for (int i=0; i<19; ++i){
			int mi = mask >> i & 1;
			auto &mp = adj[i];
			for (auto& p: mp){
				int mj = mask >> pos[p.first-'a'] & 1;			
				cur += (mi ^ mj) * p.second;
			}
		}
		if(maxn < cur){
			maxn = cur;
			ans = mask;
		}
	}
	// cout << maxn << endl;
	// construct
	for (int i=0; i<n; ++i){
		int idx = pos[s[i]-'a'];
		if(idx != -1 && ans & 1 << idx){
			s[i] -= 32;
		}
	}
	printf("%sn", s);
	return 0;
} 

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include<bits/stdc++.h>
using namespace std;
#define REDIRECT

const int INF = 0x3f3f3f3f;

using LL = long long;

int main(){
	#ifdef REDIRECT
	freopen("intel.in", "r", stdin);
	freopen("intel.out", "w", stdout);
	#endif
	
	int n;
	cin >> n;
	int px, py;
	int minx = INF, maxx = -INF, miny = INF, maxy = -INF;
	LL res = 0;
	int inx, iny;
	for (int i=0; i<n; ++i){
		int x, y;
		cin >> x >> y;		
		if(i > 0){
			if(x == px){ // vert
				miny = min(miny, min(y, py));
				maxy = max(maxy, max(y, py));
				res += abs(y - py);
			}
			else{ // hori
				minx = min(minx, min(x, px));
				maxx = max(maxx, max(x, px));
				res += abs(x - px);
			}
		}else{
			inx = x, iny = y;
		}
		px = x, py = y; 
	}
	if(inx == px){ // vert
		miny = min(miny, min(iny, py));
		maxy = max(maxy, max(iny, py));
		res += abs(iny - py);
	}
	else{ // hori
		minx = min(minx, min(inx, px));
		maxx = max(maxx, max(inx, px));
		res += abs(inx - px);
	}
	res -= 1LL * 2 * (maxx - minx) + 2 * (maxy - miny);
	cout << res << endl;
	return 0;
}