oj.uz

답안 #361828

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
361828 2021-01-31T17:36:49 Z ignaciocanta Easter Eggs (info1cup17_eastereggs) C++14
100 / 100
 22 ms 364 KB 
#include <bits/stdc++.h>
#include "grader.h"
 
using namespace std;
 
using tint = long long;
using ld = long double;
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
using pi = pair<tint,int>;
using pl = pair<tint,tint>;
using vi = vector<int>;
using vpi = vector<pi>;
using vvi = vector<vi>;
using vl = vector<tint>;
using vb = vector<bool>;

#define pb push_back
#define pf push_front
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sz(x) (int)(x).size()
#define ins insert

#define f first
#define s second
#define mp make_pair
 
#define DBG(x) cerr << #x << " = " << x << endl;
 
const int MOD = 1e9+7;
const tint mod = 998244353;
const int MX = 515;
const tint INF = 1e18; 
const int inf = 2e9;
const ld PI = acos(ld(-1)); 
const ld eps = 1e-8;
 
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
 
template<class T> void remDup(vector<T> &v){ 
    sort(all(v)); v.erase(unique(all(v)),end(v));
}

template<class T> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} 
template<class T> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
 
bool valid(int x, int y, int n, int m){
    return (0<=x && x<n && 0<=y && y<m);
}
 
int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } //redondea p arriba
int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } //redondea p abajo
 
void NACHO(string name = ""){
    ios_base::sync_with_stdio(0); cin.tie(0);
    if(sz(name)){
		freopen((name+".in").c_str(), "r", stdin);
		freopen((name+".out").c_str(), "w", stdout);
	}
}

vi adj[MX];
vi ord;

void dfs(int node, int pa){
	ord.pb(node+1);
	trav(u, adj[node]){
		if(u != pa){
			dfs(u, node);
		}
	}
}

int findEgg (int N, vector < pair < int, int > > bridges)
{
	ord.clear();
	F0R(i, MX) adj[i].clear();
    F0R(i, N-1){
		int u = bridges[i].f, v = bridges[i].s;
		--u, --v;
		adj[u].pb(v);
		adj[v].pb(u);
	}
	dfs(0, -1);
	int low = 0, high = N;
	vi a = vi(begin(ord), begin(ord)+2);
	while(high-low > 1){
		int mid = low+(high-low)/2;
		if(query(vi(begin(ord), begin(ord)+mid)) > 0) high = mid;
		else low = mid;
	}
	return ord[high-1];
}

Compilation message

eastereggs.cpp: In function 'void NACHO(std::string)':
eastereggs.cpp:69:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   69 |   freopen((name+".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
eastereggs.cpp:70:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   70 |   freopen((name+".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Number of queries: 4
2 Correct 1 ms 364 KB Number of queries: 4
3 Correct 1 ms 364 KB Number of queries: 4
4 Correct 1 ms 364 KB Number of queries: 4

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 364 KB Number of queries: 8
2 Correct 12 ms 364 KB Number of queries: 9
3 Correct 19 ms 364 KB Number of queries: 9
4 Correct 18 ms 364 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 364 KB Number of queries: 9
2 Correct 17 ms 364 KB Number of queries: 9
3 Correct 20 ms 364 KB Number of queries: 9
4 Correct 22 ms 364 KB Number of queries: 9