Submission #9546

#	Time	Username	Problem	Language	Result	Execution time	Memory
9546		dominyellow	Wiring (kriii2_W)	C++98	0 / 4	0 ms	1208 KiB

P

#include <stdio.h>
#include <map>
#include <queue>
#include <set>
#include <vector>

using namespace std;

int main(void){
	int N;
	scanf("%d", &N);

	map<int, int> q_map;

	q_map[0] = 0;

	map<pair<int, int>, bool> line_map;

	int line_count = 0;
	int i;
	for(int i=1; i<=N*N; i++){
		int q_i;
		q_i = (q_map[i-1]+i) % N;
		if(q_i == 0){
			break;
		}
		if(q_map.count(q_i) == 0){
			q_map[i] = q_i;
		}

		if(q_map[i-1] != q_i){
			if(line_map.count(make_pair(q_map[i-1], q_i)) == 0 && line_map.count(make_pair(q_i, q_map[i-1])) == 0){
				line_map[make_pair(q_map[i-1], q_i)] = true;
				line_count += 1;
			}
		}
	}
	printf("%d\n", line_count);
	return 0;
}

• Subtask 1: 0 / 1
• Subtask 2: 0 / 3