[abc] AtCoder Beginner Contest 243

前言

传送门 :

C. Collision 2

还是有点难处理的,一开始因为图快感觉和$x$没有关系,然后就直接弄了,后面注意到需要的是 $><$这种才行

因此使用结构体 ,然后将 $y$排序,最后判断一下即可

Mycode

struct node{
	int x,y,turn;
	
}a[N];
bool cmp(node t1,node t2){
	if(t1.y != t2.y)
	return t1.y < t2.y;
	return t1.x < t2.x;
}

void solve()
{
	cin>>n;
	for(int i= 0 ;i<n;i++){
		 cin>>a[i].x>>a[i].y;
	}
	
	
	string s;cin>>s;
	for(int i=0;i<n;i++){
		a[i].turn = s[i];
		
	}
	sort(a,a+n,cmp);
	

	for(int i=1;i<n;i++){
		if(a[i].y == a[i-1].y){
			if(a[i].turn == 'L' && a[i-1].turn == 'R'){
				cout<<"Yes"<<endl;
				return;
			}
		}
	}
	cout<<"No"<<endl;
	
	
}

D.Moves on Binary Tree

因为需要变化的数很大,所以我们考虑将数变小之后再操作

因此我们可以使用vector来操作

MyCode

#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
#define IOS  ios::sync_with_stdio(false);
#define CIT  cin.tie(0);
#define COT  cout.tie(0);


#define ll long long
#define x first
#define y second
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(),x.end()


typedef priority_queue<int,vector<int>,greater<int>>  Pri_m;
typedef pair<int,int> pii;
typedef vector<int> VI;
map<int,int> mp;

const int N  = 1e5+10;
void solve()
{
	ll n,m;cin>>n>>m;
	string s;cin>>s;
	
	vector<int> a;
	
	for(int i= 0 ;i<n;i++){
		if(s[i] == 'L') a.pb(1);
		else
		if(s[i] == 'R') a.pb(2);
		else{
			if(!a.empty()) a.pop_back();
			else{
				if(m == 1) continue;
				m/=2;	
			}
		}
	}
	
	for(auto x : a){
		if(x == 1)	
		m = m*2;
		
		// m = m<<1ll;
		else
		m = m*2+1;
		// m = m<<1ll|1ll;
	}
	
	cout<<m<<endl;
	
	
}
/**mYHeart is my algorithm**/
signed main()
{
    //int t;cin>>t;while(t -- )
    solve();
    return 0;
}

E.

跑flyod然后找出 不属于最短路的边

MyCode

// Problem: E - Edge Deletion
// Contest: AtCoder - AtCoder Beginner Contest 243
// URL: https://atcoder.jp/contests/abc243/tasks/abc243_e
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

//��һ�δ��Ϻ�վ֮�� ��Ϊʹ��#define int long long TLE���¿��˺ܾõ�ʱ�� ���˼���ģ��
//����ʹ�ø��ӵ�ģ��

#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
#define IOS  ios::sync_with_stdio(false);
#define CIT  cin.tie(0);
#define COT  cout.tie(0);

#define ll long long
#define x first
#define y second
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(),x.end()


typedef priority_queue<int,vector<int>,greater<int>>  Pri_m;
typedef pair<int,int> pii;
typedef vector<int> VI;
map<int,int> mp;

const int N  = 310;
int g[N][N];


void solve()
{
	int n,m;cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(i == j )
			g[i][j] = 0 ;
			g[i][j] = 0x3f3f3f3f;
		}
	}
	
	for(int i=1;i<=m;i++){
		int a,b,w;cin>>a>>b>>w;
		g[a][b] =  g[b][a] = w;
	}
	
	for(int k = 1;k<=n; k++ ){
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				g[i][j] = min(g[i][j] , g[i][k] + g[k][j]);
			}
		}
	}
	
	int cnt = 0 ;
	
	
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(i == j )continue;
			int flag = 1;
			
			for(int k = 1;k<=n;k++){
				if(i != k && j!=k && g[i][j] == g[i][k] + g[k][j]) flag = 0 ;
			}
			cnt +=flag;
		}
	}
	
	cout<<m - cnt/2<<endl;
	
}
/**mYHeart is my algorithm**/
int main()
{
    //int t;cin>>t;while(t -- )
    solve();
    return 0;
}