Submission #9394313
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fr(i,n) for(int i=0;i<(n);++i)
#define Fr(i,n) for(int i=1;i<=(n);++i)
#define ifr(i,n) for(int i=(n)-1;i>=0;--i)
#define iFr(i,n) for(int i=(n);i>0;--i)
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
istream& in(cin);
ostream& out(cout);
int n;
in>>n;
vector<int> p(n),q(n),r(n);
for(auto&i:p) in>>i,--i;
for(auto&i:q) in>>i,--i;
fr(i,n) r[i]=i;
int a{},b{},c{};
do{
bool f=true,g=true;
fr(i,n){
if(p[i]!=r[i]) f=false;
if(q[i]!=r[i]) g=false;
}
if(f) a=c;
if(g) b=c;
++c;
}while(next_permutation(r.begin(),r.end()));
cout<<abs(a-b)<<endl;
}
Submission Info
| Submission Time | |
|---|---|
| Task | C - Count Order |
| User | Motsu_xe |
| Language | C++14 (GCC 5.4.1) |
| Score | 300 |
| Code Size | 787 Byte |
| Status | AC |
| Exec Time | 2 ms |
| Memory | 256 KiB |
Judge Result
| Set Name | All | Sample | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 300 / 300 | 0 / 0 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| All | sample_01.txt, sample_02.txt, sample_03.txt, testcase_0.txt, testcase_1.txt, testcase_2.txt, testcase_3.txt, testcase_4.txt, testcase_5.txt, testcase_6.txt, testcase_7.txt, testcase_8.txt, testcase_9.txt |
| Sample | sample_01.txt, sample_02.txt, sample_03.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| sample_01.txt | AC | 1 ms | 256 KiB |
| sample_02.txt | AC | 2 ms | 256 KiB |
| sample_03.txt | AC | 1 ms | 256 KiB |
| testcase_0.txt | AC | 1 ms | 256 KiB |
| testcase_1.txt | AC | 1 ms | 256 KiB |
| testcase_2.txt | AC | 1 ms | 256 KiB |
| testcase_3.txt | AC | 2 ms | 256 KiB |
| testcase_4.txt | AC | 1 ms | 256 KiB |
| testcase_5.txt | AC | 1 ms | 256 KiB |
| testcase_6.txt | AC | 1 ms | 256 KiB |
| testcase_7.txt | AC | 2 ms | 256 KiB |
| testcase_8.txt | AC | 2 ms | 256 KiB |
| testcase_9.txt | AC | 2 ms | 256 KiB |