日常训练17-10-15

题目链接：here

Text Editor

Gym - 101504F

emmm...又是链表都写不溜=_=||

#include <bits/stdc++.h>
using namespace std;
const int maxn  = 1e6+10;
int L[maxn], R[maxn];
char s[maxn];
char ans[maxn];

int main(){
    //freopen("in.txt", "r", stdin);
    memset(L, -1, sizeof(L));
    memset(R, -1, sizeof(R));
    scanf("%s", s);
    int now = 0;
    int cnt = 0;
    int n = strlen(s);
    for(int i = 0; i < n; i++){
        if(s[i] == 'L'){
            if(L[now] != -1) now = L[now];
        }else if(s[i] == 'R'){
            if(R[now] != -1) now = R[now];
        }else {
            cnt++;
            L[cnt] = now;
            R[cnt] = R[now];
            if(R[now] != -1) L[R[now]] = cnt;
            R[now] = cnt;
            now = cnt;
            ans[now] = s[i];
        }
    }
    for(int i = R[0]; i!=-1; i = R[i]){
        printf("%c", ans[i]);
    }
    puts("");
}

Friends of Friends

Gym - 101504G

题意：问ｘ的朋友的朋友是谁．

#include <bits/stdc++.h>
using namespace std;
const int maxn = 55;
int g[maxn][maxn];
int vis[maxn];
int ans[maxn];
int cnt = 0;
int main(){
    int n, x;
    scanf("%d %d", &n, &x);
    for(int i = 1; i <= n; i++){
        int m;
        scanf("%d", &m);
        for(int j = 0; j < m; j++){
            int u;
            scanf("%d", &u);
            g[i][u] = 1;
        }
    }
    for(int i = 1; i <= n; i++){
        if(g[x][i]) {
            vis[i] = 1;
        }
    }
    for(int i = 1; i <= n; i++){
        if(vis[i]==1){
            for(int j = 1; j <= n; j++){
                if(g[i][j]&& !vis[j] && j!= x) {
                    ans[cnt++] = j;
                    vis[j] = 2;
                }
            }
        }
    }
    sort(ans, ans+cnt);
    printf("%d
", cnt);
    for(int i = 0; i < cnt; i++){
        printf("%d%c", ans[i], i==cnt-1? '
':' ');
    }
}