codeforces round944 div4

A my first sorting problem

问题：

代码：

#include <iostream>
 
using namespace std;
 
void solve() {
    int x, y;
    cin >> x >> y;
    cout << min(x, y) << " " << max(x, y) << endl;
}
 
int main() {
    int t;
    cin >> t;
    while(t -- ) {
        solve();
    }
    return 0;
}

B ifferent string

问题：

代码：

#include <iostream>
 
using namespace std;
 
string str;
 
void solve() {
    cin >> str;
    bool flag = false;
    char c = str[0];
    int idx = 0;
 
    for(int i = 0; str[i]; i ++ ) {
        if(str[i] != c) {
            flag = true;
            idx = i;
            c = str[i];
            break;
        }
    }
 
    if(!flag) cout << "NO" << endl;
    else {
        cout << "YES" << endl;
        cout << c;
        for(int i = 0; str[i]; i ++ ) {
            if(i == idx) continue;
            cout << str[i];
        }
        cout << endl;
    }
}
 
int main() {
    int t;
    cin >> t;
    while(t -- ) {
        solve();
    }
    return 0;
}

C clock and strings

问题：

思路：把圆看成一条链 任选两点ab，再选两点cd，如果cd满足其中一点在区间ab内另一点在区间ab外，则两绳一定相交

代码：

#include <iostream>

using namespace std;

void solve() {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    if((a >= min(c, d) && a <= max(c, d)) && (b <= min(d, c) || b >= max(c, d))) {
        cout << "YES" << endl;
        return;
    }
    if((b >= min(c, d) && b <= max(c, d)) && (a <= min(d, c) || a >= max(c, d))) {
        cout << "YES" << endl;
        return;
    }
    cout << "NO" << endl;
}

int main() {
    int t;
    cin >> t;
    while(t -- ) {
        solve();
    }
    return 0;
}

D binary cut

问题：

思路：顺着题意写就行

代码：

#include <iostream>

using namespace std;

string str;

void solve() {
    cin >> str;
    char prec = str[0];
    int ans = 0;
    bool flag = false;
    for(int i = 1; str[i]; i ++ ) {
        if(str[i] != prec) {
            flag = true;
            ans ++;
            prec = str[i];
        }
    }
    if(flag == false) cout << "1" << endl;
    else if(ans == 1) {
        if(str[0] == '0') cout << "1" << endl;
        else cout << "2" << endl;
    }
    else cout << ans << endl;
}

int main() {
    int t;
    cin >> t;
    while(t -- ) {
        solve();
    }
    return 0;
}

E find the car

问题：

思路：二分

代码：

#include <iostream>

using namespace std;

const int N = 1e5 + 10;
const double eps = 1e-8;

int n, k, q;
int a[N], b[N];

void solve() {
    cin >> n >> k >> q;
    for(int i = 1; i <= k; i ++ ) cin >> a[i];
    for(int i = 1; i <= k; i ++ ) cin >> b[i];

    while(q -- ) {
        int d;
        cin >> d;//d是每个点
        int l = 0, r = k;
        while(l < r) {
            int mid = l + r + 1 >> 1;
            if(a[mid] <= d) l = mid;
            else r = mid - 1;
        }
        int ans = 0;
        if(l == k) ans = b[k];
        else ans = b[l] + (((long long)(b[l + 1] - b[l]) * (d - a[l]))) / (a[l + 1] - a[l]);
        cout << ans << " ";
    }
    cout << endl;
}

int main() {
    int t;
    cin >> t;
    while(t -- ) {
        solve();
    }
    return 0;
}

F Circle Perimeter

问题：

不会处理精度...待补

G XOUR

问题：

思路：位运算.只有当两个数的二进制表示右移两位后完全相同，两个数才能可以进行交换操作。此时只需要把所有可以交换的数从小到大排序即可

TLE代码：

赛时一直想着排序了，由于最开始没注意到排序本身就是tle的，在写的过程中发现每次还要将首位元素删去，其实在这里应该想到堆的，但是我一点没往这里想，甚至还加了个数组idx表示当前的下标，第一次交发现越界了，原因是idx数组下标最大值是1e9 / 4，数组开大又会mle，甚至加了个离散化，最后提交上去果然tle，遂想到了堆，浪费不少时间

#include <iostream>
#include <map>
#include <queue>
#include <vector>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 2e5 + 10;

int n;
int a[N], idx[N];

int find(int x, vector<int> &b) {
    int l = 0, r = b.size() - 1;
    while(l < r) {
        int mid = l + r >> 1;
        if(b[mid] >= x) r = mid;
        else l = mid + 1;
    }
    return l;
}

void solve() {
    memset(idx, 0, sizeof idx);
    cin >> n;
    map<int, vector<int>> ma; 
    vector<int> b;
    for(int i = 1; i <= n; i ++ ) {
        cin >> a[i];
        ma[a[i] >> 2].push_back(a[i]);
        b.push_back(a[i] >> 2);
    }
    
    sort(b.begin(), b.end());
    b.erase(unique(b.begin(), b.end()), b.end());
    
    for(int i = 1; i <= n; i ++ ) {
        auto &A = ma[a[i] >> 2];
        sort(A.begin(), A.end());
        cout << A[idx[find(a[i] >> 2, b)]] << " ";
        idx[find(a[i] >> 2, b)] ++;
    }
    cout << endl;
}

int main() {
    int t;
    cin >> t;
    while(t -- ) {
        solve();
    }
    return 0;
}

堆ac代码：

#include <iostream>
#include <map>
#include <queue>
 
using namespace std;
 
const int N = 2e5 + 10;
 
int n;
int a[N];
 
void solve() {
    cin >> n;
    map<int, priority_queue<int, vector<int>, greater<int>>> ma;    
    for(int i = 1; i <= n; i ++ ) {
        cin >> a[i];
        ma[a[i] >> 2].push(a[i]);
    }
 
    for(int i = 1; i <= n; i ++ ) {
        cout << ma[a[i] >> 2].top() << " ";
        ma[a[i] >> 2].pop();
    }
    cout << endl;
}
 
int main() {
    int t;
    cin >> t;
    while(t -- ) {
        solve();
    }
    return 0;
}

G +-1

问题：

思路2sat， tarjan scc缩点

当变量大于0时看成真值，反之则假，原问题等价于在每一列中至少存在两个变量成真赋值，设每一列中元素分别为a b c则问题转化为数理逻辑 a v b, b v c, c v a因此每一列可以构造出6条边，让i * 2表示假赋值， i * 2 + 1表示真赋值，若真假赋值处于一个强连通分量中则说明与题设冲突输出no 反之则成立

代码：

#include <iostream>
#include <cstring>
#include <stack>
#include <cmath>

using namespace std;

const int N = 510;

int n;
int val[6 * N], ne[6 * N], h[2 * N], idx;
int dfn[N], low[N], id[N], ts, cnt;
bool ins[N];
int g[5][N];
stack<int> stk;

void add(int a, int b) {
    val[idx] = b;
    ne[idx] = h[a];
    h[a] = idx ++;
}

void tarjan(int u) {
    ts ++;
    dfn[u] = low[u] = ts;
    stk.push(u);
    ins[u] = 1;

    for(int i = h[u]; i != -1; i = ne[i]) {
        int j = val[i];
        if(!dfn[j]) {
            tarjan(j);
            low[u] = min(low[u], low[j]);
        } else if(ins[j]) low[u] = min(low[u], dfn[j]);
    }

    if(dfn[u] == low[u]) {
        int y;
        cnt ++;
        do {
            y = stk.top();
            stk.pop();
            ins[y] = false;
            id[y] = cnt;
        } while(y != u);
    }
}

void solve() {
    memset(ins, 0, sizeof ins);
    memset(h, -1, sizeof h);
    memset(dfn, 0, sizeof dfn);
    memset(low, 0, sizeof low);
    memset(id, 0, sizeof id);
    idx = 0;
    cin >> n;
    for(int i = 1; i <= 3; i ++ ) {
        for(int j = 1; j <= n; j ++ ) {
            cin >> g[i][j];
        }
    }

    for(int i = 1; i <= n; i ++ ) {
        int a = g[1][i];
        int b = g[2][i];
        int c = g[3][i];
        int tmpa = (a > 0)? a: -a;
        int tmpb = (b > 0)? b: -b;
        int tmpc = (c > 0)? c: -c;
        tmpa --;
        tmpb --;
        tmpc --;
        add(tmpa * 2 + !(a < 0), tmpb * 2 + (b < 0));
        add(tmpb * 2 + !(b < 0), tmpa * 2 + (a < 0));
        add(tmpa * 2 + !(a < 0), tmpc * 2 + (c < 0));
        add(tmpc * 2 + !(c < 0), tmpa * 2 + (a < 0));
        add(tmpb * 2 + !(b < 0), tmpc * 2 + (c < 0));
        add(tmpc * 2 + !(c < 0), tmpb * 2 + (b < 0));
    }

    for(int i = 0; i <= 2 * n - 1; i ++ ) 
        if(!dfn[i]) 
            tarjan(i);

    for(int i = 0; i < n; i ++ ) {
        if(id[i * 2] == id[i * 2 + 1]) {
            cout << "NO" << endl;
            return;
        }
    }
    cout << "YES" << endl;    
}

int main() {
    int t;
    cin >> t;
    while(t -- ) {
        solve();
    }
    return 0;
}