Codeforces 902 树同型构造 多项式长除法构造(辗转相除法)

A

#include <bits/stdc++.h>
#define PI acos(-1.0)
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define inf 1e9
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que;
const double eps = 1.0e-6;
typedef pair<int, int> pairint;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e6 + ;
const int  maxm = ;
const int turn[][] = {{, }, { -, }, {, }, {, -}};
//next_permutation
ll mod = 1e9 + ;
int n, aim;
int v[];
int main()
{
        //freopen("in.txt", "r", stdin);
        //freopen("out1.txt", "w", stdout);
        cin >> n >> aim;
        int pa = , pb = ;
        v[] = ;
        for (int i = ; i <= n; i++)
        {
                cin >> pa >> pb;
                if (!v[pa])
                {
                        cout << "NO" << endl;
                        exit();
                }
                for (int j = pa; j <= pb; j++)
                {
                        //cout<<j<<endl;
                        v[j] = ;
                }
                if (v[aim])
                {
                        cout << "YES" << endl;
                        exit();
                }
        }
        cout << "NO" << endl;
}

B

#include <bits/stdc++.h>
#define PI acos(-1.0)
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define inf 0x3f3f3f3f
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que; get min
const double eps = 1.0e-10;
const double EPS = 1.0e-4;
typedef pair<int, int> pairint;
typedef long long ll;
typedef unsigned long long ull;
//const int maxn = 3e5 + 10;
const int turn[][] = {{, }, { , }, { , -}, { -, }};
//priority_queue<int, vector<int>, less<int>> que;
//next_permutation
int n;
vector<int> tree[];
int anser = ;
int color[];
int aim[];
void dfs(int x, int now)
{
        if (now != aim[x])
        {
                anser++;
                now = aim[x];
        }
        int len = tree[x].size();
        for (int i = ; i < len; i++)
        {
                int to = tree[x][i];
                dfs(to, now);
        }
}
int main()
{
        //freopen("out.txt","w",stdout);
        cin >> n;
        for (int i = ; i <= n; i++)
        {
                int now;
                cin >> now;
                tree[now].pb(i);
        }
        for (int i = ; i <= n; i++)
        {
                cin >> aim[i];
        }
        dfs(, );
        cout << anser << endl;
        return ;
}

C

#include <bits/stdc++.h>
#define PI acos(-1.0)
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define inf 1e9
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que;
const double eps = 1.0e-6;
typedef pair<int, int> pairint;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e6 + ;
const int  maxm = ;
const int turn[][] = {{, }, { -, }, {, }, {, -}};
//next_permutation
ll mod = 1e9 + ;
int n;
int h[];
int main()
{
        //freopen("in.txt", "r", stdin);
        //freopen("out1.txt", "w", stdout);
        cin >> n;
        int flag = ;
        int now = ;
        for (int i = ; i <= n + ; i++)
        {
                scanf("%d", h + i);
                if (h[i - ] >  && h[i] > )
                {
                        flag = ;
                }
        }
        if (!flag)
        {
                cout << "perfect" << endl;
        }
        else
        {
                cout << "ambiguous" << endl;
                for (int i = ; i <= n + ; i++)
                {
                        for (int j = ; j <= h[i]; j++)
                        {
                                cout << now << " ";
                        }
                        now += h[i];
                }
                cout << endl;
                int flag2 = ;
                now = ;
                for (int i = ; i <= n + ; i++)
                {
                        if (h[i - ] >  && h[i] >  && flag2)
                        {
                                flag2 = ;
                                cout << now -  <<" ";
                                for (int j = ; j <= h[i] - ; j++)
                                {
                                        cout << now << " ";
                                }
                        }
                        else
                        {
                                for (int j = ; j <= h[i]; j++)
                                {
                                        cout << now << " ";
                                }
                        }
                        now += h[i];
                }
                cout << endl;
        }
}

D

要求你给出两个多项式 使得A,B辗转相除N次得到答案(B为0)

仿照斐波那契数列使得Fn=x*Fn-1±Fn-2  后面的±的作用是使得给出的多项式满足系数绝对值不超过1的条件

数组可以滚动

#include <bits/stdc++.h>
#define PI acos(-1.0)
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define inf 0x3f3f3f3f
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que; get min
const double eps = 1.0e-10;
const double EPS = 1.0e-4;
typedef pair<int, int> pairint;
typedef long long ll;
typedef unsigned long long ull;
//const int maxn = 3e5 + 10;
const int turn[][] = {{, }, { , }, { , -}, { -, }};
//priority_queue<int, vector<int>, less<int>> que;
//next_permutation
int anser[][];
int main()
{
        anser[][] = ;
        anser[][] = ;
        anser[][] = ;
        int n;
        int aim = ;
        cin >> n;
        for (int i = ; i <= n; i++)
        {
                aim ^= ;
                for (int j = ; j <= i; j++)
                {
                        anser[aim][j] = (anser[aim][j] + anser[aim ^ ][j - ]) % ;
                }
        }
        cout << n << endl;
        for (int i = ; i <= n; i++)
        {
                cout << anser[aim][i] << " ";
        }
        cout << endl << n -  << endl;
        for (int i = ; i < n; i++)
        {
                cout << anser[aim ^ ][i] << " ";
        }
        cout << endl;
}