oj.uz

답안 #894761

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894761 2023-12-28T22:45:34 Z thunopro 함박 스테이크 (JOI20_hamburg) C++14
2 / 100
 75 ms 19044 KB 
#include<bits/stdc++.h>
using namespace std ; 
#define maxn 300009 
#define ll long long 
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1 
#define right id<<1|1
#define re exit(0);
#define _lower(v,x) lower_bound(v.begin(),v.end(),x)-v.begin()+1

const int mod = 1e9+7 ; 
const int INF = 1e9 ;
const int LOG = 18 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ;
typedef vector<ll> vl ;  
typedef pair<ll,ll> pll ; 
typedef vector<pll> vll ; 

void add ( int&a , int b ) { if ((a+=b) > mod ) a -= mod ; } 
void sub ( int&a , int b ) { if ((a-=b) < 0 ) a += mod ; } 
template<typename T> void chkmin(T& x, T y) {if(x > y) x = y;}
template<typename T> void chkmax(T& x, T y) {if(x < y) x = y;}

void rf ( ) 
{
	freopen ("bai1.inp","r",stdin) ; 
//	freopen ("bai1.out","w",stdout) ;
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow ( a , n / 2 ) ; 
	if ( n % 2 ) return ( 1ll * res * res % mod * a % mod ) ; 
	else return ( 1ll * res * res % mod ) ; 
}

int n , k ; 
struct rect {
	int x1 , y1 , x2 , y2 ; 
} a [maxn] ;

rect get_rect ( rect x , rect y ) 
{
	rect ans ; 
	ans.x1 = max (x.x1,y.x1) ; 
	ans.x2 = min (x.x2,y.y2) ; 
	ans.y1 = max (x.y1,y.y1) ; 
	ans.y2 = min (x.y2,y.y2) ; 
	return ans ; 
}
void sub1 () 
{
	rect ans ; 
	ans.x1 = ans.y1 = 0 ; 
	ans.x2 = ans.y2 = INF ; 
	for ( int i = 1 ; i <= n ; i ++ ) ans = get_rect (ans,a[i]) ; 
	cout << ans.x1 << " " << ans.y1 ; 
}

int colour [maxn] ; 
vi adjList [maxn] ; 
void dfs ( int u , int c ) 
{
	colour [u] = c ; 
	for ( auto v : adjList [u] ) 
	{
		if ( colour [v] == - 1 ) dfs (v,c^1) ; 
	}
}
void sub2 () 
{
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		for ( int j = i+1 ; j <= n ; j ++ ) 
		{
			rect ans = get_rect (a[i],a[j]) ; 
			if ( ans.x1 > ans.x2 || ans.y1 > ans.y2 ) 
			{
				adjList [i] . pb (j) ; 
				adjList [j] . pb (i) ; 
			}
		}
	}
	memset ( colour , -1, sizeof colour ) ; 
	for ( int i = 1 ; i <= n ; i ++ ) if ( colour [i] == - 1 ) dfs (i,0) ; 
	rect ans [3] ; 
	for ( int i = 0 ; i <= 1 ; i ++ ) ans[i].x1 = ans[i].y1 = 0 , ans[i].x2 = INF , ans[i].y2 = INF ; 
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		if ( colour [i] == 0 ) ans [0] = get_rect (ans[0],a[i]) ;
		else ans [1] = get_rect (ans[1],a[i]) ; 
	}
	cout << ans [0].x1 << " " << ans [0].y1 << "\n" ; 
	cout << ans [1].x1 << " " << ans [1].y1 ; 
} 
int main ( ) 
{
	ios_base :: sync_with_stdio (0) ; 
	cin.tie(0) ; cout.tie(0) ;
//	rf () ;
	cin >> n >> k ; 
	for ( int i = 1 ; i <= n ; i ++ ) cin >> a [i].x1 >> a [i].y1 >> a [i].x2 >> a [i].y2 ; 
		
	if ( k == 1 ) sub1 () ;  
	else if ( k == 2 && n <= 2000 ) sub2 () ; 
	
}




//-std=c++11

Compilation message

hamburg.cpp: In function 'void rf()':
hamburg.cpp:31:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 3 ms 8920 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 3 ms 8796 KB Output is correct

Subtask #2
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 9112 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 8796 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 8796 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #5
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 3 ms 8920 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 3 ms 8796 KB Output is correct
5 Correct 66 ms 19044 KB Output is correct
6 Correct 63 ms 18796 KB Output is correct
7 Correct 75 ms 18768 KB Output is correct
8 Correct 62 ms 18764 KB Output is correct

Subtask #6
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 9112 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 8796 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #8
0 / 79.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 8796 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -