Dijkstra序列 + 订单编号(Day 5)

Dijkstra序列

将朴素版dijkstra改版一下，因为dijkstra基于贪心，而题目中的告诉了你每次贪心所得到的点号，只需要判断一下
当前dijkstra的点是否为输入的点即可！
#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
const int N = 1010, M = 200010;
int n, m, k;
int g[N][N];
int st[N];
int dist[N];
int a[N];

bool  dijkstra(int sx)
{
    memset(dist, 0x3f, sizeof dist);
    memset(st, 0, sizeof st);
    dist[sx] = 0;

    int cnt = 0;
    for(int i = 0; i < n - 1; i ++ )
    {
        int t = a[i];
        for (int j = 1; j <= n; j ++ )
            if(!st[j] && dist[j] < dist[t])
                t = j;


        if(t != a[cnt ++])  return false;
        st[t] = true;

        for(int j = 1; j <= n; j ++ )   dist[j] = min(dist[j], dist[t] + g[t][j]);  
    }
    return true;

}

int main()
{
    cin >> n >> m;
    memset(g, 0x3f, sizeof g);

    while (m -- )
    {
        int a, b, c;
        cin >> a >> b >> c;
        g[a][b] = g[b][a] = c;
    }
    cin >> k;
    while(k -- )
    {
        for (int i = 0; i < n; i ++ )   cin >> a[i];
        if(dijkstra(a[0]))  puts("Yes");
        else    puts("No");
    }
}

div2

订单编号

很难啊,根本想不到用set去维护区间，然后增加删除区间这种骚操作。G!

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

#define x first
#define y second
#define rep(i,a,n) for (int i = a; i < n; i ++ )
#define repn(i,a,n) for (int i = a; i <= n; i ++ )
#define pb push_back
#define IOS ios::sync_with_stdio(false); cin.tie(0);cout.tie(0);
typedef long long ll;
typedef pair<int,int> PII;

ll gcd(ll a,ll b) { return b ? gcd(b,a % b) : a; }
const int mod = 1e9+7;
set< PII > c;

void insert(int l, int r)
{
    if (l > r)  return;
    c.insert({r, l});
}

int main()
{
    IOS;
    int n;
    cin >> n;
    c.insert({2e9, 1});

    for (int i = 1; i <= n; i ++ )
    {
        int x;
        cin >> x;
        auto it = c.lower_bound({x, 0});//左大右小
        if(it->second <= x){
            cout << x << ' ';
            insert(it->second, x - 1);
            insert(x + 1, it->first);
            c.erase(it);
        }else{
            cout << it->second << ' ';
            insert(it->second + 1, it->first);
            c.erase(it);
        }
    }
    
    return 0;
}