oj.uz

Submission #9528

# Submission time Handle Problem Language Result Execution time Memory
9528 2014-09-28T07:03:17 Z dominyellow Wiring (kriii2_W) C++
0 / 4
 1000 ms 35000 KB 
#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_map.count(i) == 0){
			q_map[i] = q_i;
		}
		else{
			break;
		}
		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.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 660 ms 17840 KB Output is correct
2 Execution timed out 1000 ms 35000 KB Program timed out
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -