Submission #2322898

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <fstream>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <string.h>
#include <time.h>
#include <stdlib.h>
#include <cmath>
#include <queue>

using namespace std;
typedef pair<int, int> pii;

unsigned long w;
int iter;

int dy[] = { 0, -1, -1, -1, 0, 1, 1, 1, 0 };
int dx[] = { 1, 1, 0, -1, -1, -1, 0, 1, 1 };

int total;
int score;
int V, E;
int Vemb, Eemb;
int sqVemb;
int G[502][502];
int KG[62][62];
int phi[501][2];
//pii phi[501];

inline unsigned long xor128() {
	static unsigned long x = 123456789, y = 362436069, z = 521288629 /*, w = 88675123*/;
	unsigned long t = (x ^ (x << 11));
	x = y; y = z; z = w;
	return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}

inline void swap(int u, int v) {

	int* upos = phi[u];
	int* vpos = phi[v];

	for (int d = 0; d < 8; d++) {
		int x = upos[1] + dx[d];
		int y = upos[0] + dy[d];
		score -= G[u][KG[y][x]];
	}
	KG[upos[0]][upos[1]] = 0;

	for (int d = 0; d < 8; d++) {
		int x = vpos[1] + dx[d];
		int y = vpos[0] + dy[d];
		score -= G[v][KG[y][x]];
	}
	KG[vpos[0]][vpos[1]] = 0;

	KG[upos[0]][upos[1]] = v;
	for (int d = 0; d < 8; d++) {
		int x = upos[1] + dx[d];
		int y = upos[0] + dy[d];
		score += G[v][KG[y][x]];
	}

	KG[vpos[0]][vpos[1]] = u;
	for (int d = 0; d < 8; d++) {
		int x = vpos[1] + dx[d];
		int y = vpos[0] + dy[d];
		score += G[u][KG[y][x]];
	}

	std::swap(upos[0], vpos[0]);
	std::swap(upos[1], vpos[1]);
}

inline void nswapWithoutConstraints(int n) {
	for (int i = 0; i < n; i++) {
		int u = xor128() % V + 1;
		int v = xor128() % V + 1;
		while (u == v) v = xor128() % V + 1;
		swap(u, v);
	}
}

inline double getTemp(double startTemp, double endTemp, double deg = 1.0, double t = (double)clock() / CLOCKS_PER_SEC, double T = 10.0) {
	return endTemp + (startTemp - endTemp) * pow((T - t) / T, deg);
}

inline void nswapWithProbability(int n, double T = 10.0) {
	double temp = getTemp(5, 0.1);
	int R = 100000000;

	for (int i = 0; i < n; i++) {
		int prev_score = score;
		int u = xor128() % V + 1;
		int v = xor128() % V + 1;
		while (u == v) v = xor128() % V + 1;
		swap(u, v);
		if (score < prev_score) {
			double prob = exp((score - prev_score) / temp);
			if (prob < (double)(xor128() % R) / R) {
				swap(u, v);
			}
		}
	}
	iter++;
}

int main()
{
	srand((unsigned)time(NULL));
	w = rand();

	memset(G, 0, sizeof(G));
	memset(KG, 0, sizeof(KG));

	scanf("%d%d", &V, &E);
	int u, v;
	for (int i = 0; i < E; i++) {
		scanf("%d%d", &u, &v);
		G[u][v] = G[v][u] = 1;
	}
	scanf("%d%d", &Vemb, &Eemb);
	int a, b;
	for (int i = 0; i < Eemb; i++) {
		scanf("%d%d", &a, &b);
	}
	for (sqVemb = 1; ; sqVemb++) if (sqVemb * sqVemb == Vemb) break;


	typedef pair<double, pii> pdii;
	priority_queue<pdii> pq;

	double cx, cy;
	cx = cy = sqVemb / 2;

	for (int y = 1; y <= sqVemb; y++) {
		for (int x = 1; x <= sqVemb; x++) {
			double d = (cx - x) * (cx - x) + (cy - y) * (cy - y);
			pq.push(pdii(-d, pii(y, x)));
		}
	}

	for (int i = 1; i <= V; i++) {
		pii p = pq.top().second; pq.pop();
		int x = p.second;
		int y = p.first;


		cout << 1 << " " << (y - 1) * sqVemb + x << endl;
	}

	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:118:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &V, &E);
                       ^
./Main.cpp:121:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &u, &v);
                        ^
./Main.cpp:124:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &Vemb, &Eemb);
                             ^
./Main.cpp:127:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
                        ^

Judge Result