Submission #420693

#	Time	Username	Problem	Language	Result	Execution time	Memory
420693		JvThunder	MalnaRISC (COI21_malnarisc)	C++14	67.63 / 100	10 ms	2764 KiB

malnarisc

#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
typedef long long ll;
 
using namespace std;
 
int n;
 
bool cmp(int a,int b,int c,int d)
{
    if(a!=c && a!=d && b!=c && b!=d) return true;
    return false;
}

vector<pair<int,int>> v[100005];
void solve()
{
    cin >> n;
    int cnt = 1;
    for(int i=1;i<=n;i++)
    {
        for(int j=i+1;j<=n;j++)
        {
            bool cantog = false;
            for(int k=1;k<=cnt;k++)
            {
                bool caninv = true;
                for(auto x:v[k])
                {
                    if(cmp(i,j,x.fir,x.sec)==false)
                    {
                        caninv = false;
                        break;
                    }
                }
                if(caninv)
                {
                    cantog = true;
                    v[k].pb({i,j});
                    break;
                }
            }
            if(!cantog)
            {
                cnt++;
                v[cnt].pb({i,j});
            }
        }
    }
 
    cout << cnt << endl;
    for(int i=1;i<=cnt;i++)
    {
        for(auto x:v[i])
        {
            cout << "CMPSWP R" << x.fir << " R" << x.sec << " ";
        }
        cout << endl;
    }
	return;
}
 
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int tc=1;
	//cin>>tc;
	for(int i=1;i<=tc;i++) solve();
 	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 7.6666666667 / 10
• Subtask 3: 8.4444444444 / 10
• Subtask 4: 7.6666666667 / 10
• Subtask 5: 6.4567901235 / 10
• Subtask 6: 7.213592233 / 10
• Subtask 7: 3.9824561404 / 10
• Subtask 8: 4.803030303 / 10
• Subtask 9: 5.4429530201 / 10
• Subtask 10: 5.9518072289 / 10