| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1365418 | mrasool1665 | 마술쇼 (APIO24_show) | C++20 | 0 ms | 0 KiB |
//MRasol kheyri
//Iran -> Khorasan -> ferdows -> Baghestan
//15/2/1405
//vasate azmoonima...
#include<bits/stdc++.h>
#include "Bob.h"
using namespace std ;
typedef long long ll ;
#define el '\n'
const ll maxn = 1e6 + 100 ;
const ll prime = 67 ;
ll n = 5000 ;
ll par[maxn] , ok[maxn] ;
ll Bob(vector<pair<int,int>> V){
fill(par,par+n,-1) ;
for(ll i = 0 ; i < V.size() ; i++){
ll u = min(V[i].first,V[i].second) , B = max(V[i].fisrt,V[i].second) ;
u-- , v-- ;
par[v] = u ;
}
ll x = 0 ;
for(ll i = 2 ; i < n ; i++){
ll bit = i%prime ;
if(par[i] == -1 || ok[bit]){continue;}
ok[bit] = 1 ;
ll b = ((i-1)/2) + 1 ;
if(b <= par[i]){
x += 1<<bit ;
}
}
return x ;
}//MRasol kheyri
//Iran -> Khorasan -> ferdows -> Baghestan
//15/2/1405
//vasate azmoonima...
#include<bits/stdc++.h>
#include "Bob.h"
using namespace std ;
typedef long long ll ;
#define el '\n'
const ll maxn = 1e6 + 100 ;
const ll prime = 67 ;
ll n = 5000 ;
ll par[maxn] , ok[maxn] ;
ll Bob(vector<pair<int,int>> V){
fill(par,par+n,-1) ;
for(ll i = 0 ; i < V.size() ; i++){
ll u = min(V[i].first,V[i].second) , B = max(V[i].fisrt,V[i].second) ;
u-- , v-- ;
par[v] = u ;
}
ll x = 0 ;
for(ll i = 2 ; i < n ; i++){
ll bit = i%prime ;
if(par[i] == -1 || ok[bit]){continue;}
ok[bit] = 1 ;
ll b = ((i-1)/2) + 1 ;
if(b <= par[i]){
x += 1<<bit ;
}
}
return x ;
}