dmh66666666

1.

#include<stdio.h>
   struct Node
  {
     int next, data;
  }  
   node[100001];
    int main()
{
int start_address,num,temp;
scanf("%d%d", &start_address, &num);
for (int i = 0; i < num; i++)
{
scanf("%d", &temp);
scanf("%d%d", &node[temp].data, &node[temp].next);
}

int order[num]; order[0] = start_address;
for (int i = 1;; i++)
{
if (node[order[i - 1]].next == -1) {num = i; break;}
order[i] = node[order[i - 1]].next;
}

int flag = -1, a = 0, b = num - 1;
for (int i = 1; i < num; i++, flag *= -1)
{
if (flag == -1) {node[order[b--]].next = order[a];}
else {node[order[a++]].next = order[b];}
}
node[order[a]].next = -1; temp = order[num - 1];
for (int i = 1; i < num; i++)
{
printf("%05d %d %05d\n", temp, node[temp].data, node[temp].next);
temp = node[temp].next;
}
printf("%05d %d %d\n", temp, node[temp].data, node[temp].next);
return 0;
}

3.

#include<bits/stdc++.h>
using namespace std;
const int N=100005;

int m,cnt,ans[N];
int h[N],e[N],ne[N],idx;

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

void dfs(int a)
{
    for(int i=h[a];i!=-1;i=ne[i])
    {
        int j=e[i];
        cout<<" "<<j;
        dfs(j);
    }
}

int main()
{
    cin>>m;
    memset(h,-1,sizeof h);
    for(int i=1;i<=m;i++)
    {
        int a;
        cin>>a;
        ans[i]=a;
    }
    for(int i=m;i>0;i--)
    {
        if(ans[i]==0)
        {
            cnt=i;
            continue;
        }
        add(ans[i],i);
    }
    int maxn=0,jud=1;
    for(int i=1;i<=m;i++)
    {
        int num=0;
        for(int k=h[i];k!=-1;k=ne[k])
        {
            if(ne[k]==-1)
            {
                num++;
                break;
            }
            else
                num++;
        }
        if(num!=maxn&&num!=0)
        {
            if(maxn!=0)
                jud=0;
            if(maxn<num)
                maxn=num;
        }
    }
    if(jud)
    {
        cout<<maxn<<" yes"<<endl;
        cout<<cnt;
        dfs(cnt);
    }
    else
    {
        cout<<maxn<<" no"<<endl;
        cout<<cnt;
        dfs(cnt);
    }
    return 0;
}

4.

#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
const int N=100500;

int m,n,sum,cnt,dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
vector<int> ans[N];
vector<pii> p[N];

pii find(int a,int b)
{
    if(p[a][b].first!=a||p[a][b].second!=b)
        p[a][b]=find(p[a][b].first,p[a][b].second);
    return p[a][b];
}

int main()
{
    cin>>m>>n;
    int vis[m+2][n+2]={0};
    for(int i=0;i<=n+1;i++)
    {
        ans[0].push_back(0);
        ans[m+1].push_back(0);
        p[0].push_back({0,0});
        p[m+1].push_back({0,0});
    }
    for(int i=1;i<=m;i++)
    {
        ans[i].push_back(0);
        p[i].push_back({0,0});
    }
    for(int i=1;i<=m;i++)
    {
        string s;
        cin>>s;
        for(int j=0;j<s.size();j++)
        {
            ans[i].push_back(s[j]-'0');
            p[i].push_back({i,j+1});
        }
    }
    for(int i=0;i<=m;i++)
    {
        ans[i].push_back(0);
        p[i].push_back({0,0});
    }
    for(int i=1;i<=m;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(ans[i][j]!=0)
            {
                for(int k=0;k<4;k++)
                {
                    if(ans[i+dx[k]][j+dy[k]]!=0)
                    {
                        if(find(i,j)==find(i+dx[k],j+dy[k]))
                            continue;
                        else
                            p[find(i,j).first][find(i,j).second]=find(i+dx[k],j+dy[k]);
                    }
                }
            }
        }
    }
    for(int i=1;i<=m;i++)
    {
        for(int j=1;j<=n;j++)
        {
            vis[find(i,j).first][find(i,j).second]=max(vis[find(i,j).first][find(i,j).second],ans[i][j]);
        }
    }
    for(int i=1;i<=m;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(vis[i][j]>=1)
                sum++;
            if(vis[i][j]>1)
                cnt++;
        }
    }
    cout<<sum<<" "<<cnt<<endl;
    return 0;
}

5.

#include<bits/stdc++.h>
using namespace std;
long long n,a[200005];
vector<long long> ans[100005];

int main()
{
    cin>>n;
    for(int i=0;i<2*n;i+=2)
    {
        cin>>a[i]>>a[i+1];
    }
    int t=1,maxn=0;
    sort(a,a+2*n);
    for(int i=1;i<2*n;i++)
    {
        if(a[i]!=a[i-1])
        {
            ans[t].push_back(a[i-1]);
            if(maxn<t)
            {
                maxn=t;
            }
            t=1;
        }
        else t++;
    }
    ans[t].push_back(a[2*n-1]);
    cout<<ans[maxn][0]<<" "<<maxn;
    if(ans[maxn].size()>1)
        cout<<" "<<ans[maxn].size();
    cout<<endl;
    return 0;
}

6.

#include<bits/stdc++.h>
using namespace std;
int m,n,cnts=0,ps=0,ans[10005][105];
map<vector<int>,int> mp;
vector<vector<int>> cnt;
struct pvi
{
    int I;
    vector<int> V;
    bool operator <(const pvi&other)const
    {
        if(I!=other.I)
            return I>other.I;
        else
            return V<other.V;
    }
};

int main()
{
    vector<pvi> p;
    cin>>m>>n;
    for(int i=0;i<m;i++)
    {
        vector<int> t;
        for(int j=0;j<n;j++)
        {
            cin>>ans[i][j];
            t.push_back(ans[i][j]);
        }
        if(!mp[t])
        {
            mp[t]=1;
            cnt.push_back(t);
            cnts++;
            continue;
        }
        mp[t]++;
    }
    for(int i=0;i<cnts;i++)
    {
        p.push_back({mp[cnt[i]],cnt[i]});
    }
    sort(p.begin(),p.end());
    cout<<cnts;
    for(int i=0;i<cnts;i++)
    {
        cout<<endl<<p[i].I;
        for(int j=0;j<n;j++)
            cout<<" "<<p[i].V[j];
    }
    return 0;
}