제출 #68378

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
68378		Mamnoon_Siam	보물 찾기 (CEOI13_treasure2)	C++17	10 / 100	3 ms	944 KiB

treasure

// countTreasure Report
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>
#include "treasure.h"
// #include <bits/extc++.h>
using namespace std;

#define debug(s) cout << #s << " = " << s << endl
#define all(v) (v).begin(), (v).end()
#define KeepUnique(v) (v).erase( unique(all(v)), v.end() )
#define MEMSET(a, val) memset(a, val, sizeof (a))
#define PB push_back
#define endl '\n'
typedef long long ll;

inline int myrand(int l, int r) {
	int ret = rand(); ret <<= 15; ret ^= rand();
	if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
	return ret;
}

template <typename F, typename S>
ostream& operator << (ostream& os, const pair< F, S>& p) {
	return os<<"(" <<p.first<<", "<<p.second<<")"; }

typedef pair<int, int> ii;

template<typename T> using min_pq =
	std::priority_queue<T, vector<T>, greater<T> >;

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

void findTreasure (int N) {
	vector<ii> v;
	for(int i = 1; i <= N; i++) {
		for(int j = 1; j <= N; j++) {
			if(countTreasure(i, j, i, j)) {
				v.emplace_back(i, j);
			}
		}
	}
	for(ii &b : v) {
		Report(b.first, b.second);
	}
}

컴파일 시 표준 에러 (stderr) 메시지

treasure.cpp: In function 'int myrand(int, int)':
treasure.cpp:20:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
  ^~
treasure.cpp:20:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
                          ^~~

• Subtask 1: 10 / 100