제출 #1241826

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1241826		CELD_07	Permutation Game (APIO25_permgame)	C++20	6 / 100	1 ms	328 KiB

permgame

#include "permgame.h"
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
typedef long long ll;
typedef long double ld;
#define endl "\n"
#define vll vector<ll>
#define sd second
#define ft first
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define pll pair<ll, ll>
#define mod 1000000007
#define _set tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
#define inf (ll)1e15
#define sz(x) (int)x.size()
#define db(x) cout<<#x<<" : "<<x<<endl;
#define PRESICION(x) cout.setf(ios::fixed,ios::floatfield); cout.precision(x);
using namespace std;
using namespace __gnu_pbds;
int Alice(int m, int e, std::vector<int> u, std::vector<int> v, int n, std::vector<int> p) {
    ll res=0;
    for(int i=0; i<n; i++){
        if(p[i]==i)res++;
    }
    return res;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 6
• Subtask 2: 6 / 6
• Subtask 3: 0 / 10
• Subtask 4: 0 / 24
• Subtask 5: 0 / 24
• Subtask 6: 0 / 30