Submission #67138868

Source Code Expand

#include<iostream>
#include<vector>
using namespace std;
int n,m;
vector<vector<bool>>node(9,vector<bool>(9,false));
int f(vector<int>count,int now,int cost){
  if(now==n+1){
    bool ok=true;
    for(int i=0;i<n;i++)if(count[i]!=2)ok=false;
    if(ok)return n-cost+m-cost;
    else return 1e9;
  }
  int ans=1e9;
  if(count[now-1]==2)return f(count,now+1,cost);
  for(int i=now+1;i<=n;i++){
    if(count[i-1]==2)continue;
    count[now-1]++;
    count[i-1]++;
    int hako=0;
    if(node[now][i])hako=1;

    if(count[now-1]==2)ans=min(ans,f(count,now+1,cost+hako));
    else ans=min(ans,f(count,now,cost+hako));

    count[now-1]--;
    count[i-1]--;
  }
  return ans;
}   
    
int main()
{
  cin >> n >> m;
  for(int i=0;i<m;i++){
    int a,b;
    cin >> a >> b;
    if(a>b)swap(a,b);
    node[a][b]=true;
    node[b][a]=true;
  }
  vector<int>count(n,0);
  cout << f(count,1,0) << endl;
}

Submission Info

Submission Time
Task D - Make 2-Regular Graph
User rotti
Language C++ 20 (gcc 12.2)
Score 0
Code Size 935 Byte
Status WA
Exec Time 6 ms
Memory 3696 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 425
Status
AC × 4
AC × 40
WA × 16
Set Name Test Cases
Sample sample00.txt, sample01.txt, sample02.txt, sample03.txt
All sample00.txt, sample01.txt, sample02.txt, sample03.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt, testcase27.txt, testcase28.txt, testcase29.txt, testcase30.txt, testcase31.txt, testcase32.txt, testcase33.txt, testcase34.txt, testcase35.txt, testcase36.txt, testcase37.txt, testcase38.txt, testcase39.txt, testcase40.txt, testcase41.txt, testcase42.txt, testcase43.txt, testcase44.txt, testcase45.txt, testcase46.txt, testcase47.txt, testcase48.txt, testcase49.txt, testcase50.txt, testcase51.txt
Case Name Status Exec Time Memory
sample00.txt AC 1 ms 3464 KiB
sample01.txt AC 1 ms 3564 KiB
sample02.txt AC 1 ms 3652 KiB
sample03.txt AC 6 ms 3500 KiB
testcase00.txt AC 1 ms 3504 KiB
testcase01.txt AC 1 ms 3568 KiB
testcase02.txt AC 1 ms 3436 KiB
testcase03.txt AC 1 ms 3512 KiB
testcase04.txt AC 6 ms 3552 KiB
testcase05.txt AC 1 ms 3556 KiB
testcase06.txt AC 1 ms 3464 KiB
testcase07.txt AC 6 ms 3624 KiB
testcase08.txt AC 1 ms 3504 KiB
testcase09.txt AC 1 ms 3508 KiB
testcase10.txt AC 6 ms 3436 KiB
testcase11.txt WA 1 ms 3504 KiB
testcase12.txt AC 1 ms 3500 KiB
testcase13.txt AC 1 ms 3492 KiB
testcase14.txt AC 1 ms 3504 KiB
testcase15.txt WA 6 ms 3500 KiB
testcase16.txt AC 6 ms 3564 KiB
testcase17.txt AC 1 ms 3492 KiB
testcase18.txt AC 1 ms 3492 KiB
testcase19.txt AC 6 ms 3560 KiB
testcase20.txt AC 5 ms 3468 KiB
testcase21.txt AC 1 ms 3552 KiB
testcase22.txt AC 1 ms 3624 KiB
testcase23.txt AC 1 ms 3564 KiB
testcase24.txt WA 1 ms 3504 KiB
testcase25.txt AC 6 ms 3548 KiB
testcase26.txt AC 6 ms 3560 KiB
testcase27.txt WA 6 ms 3652 KiB
testcase28.txt WA 6 ms 3512 KiB
testcase29.txt WA 1 ms 3504 KiB
testcase30.txt WA 6 ms 3544 KiB
testcase31.txt WA 1 ms 3560 KiB
testcase32.txt WA 5 ms 3628 KiB
testcase33.txt WA 6 ms 3628 KiB
testcase34.txt WA 6 ms 3564 KiB
testcase35.txt WA 6 ms 3464 KiB
testcase36.txt WA 1 ms 3492 KiB
testcase37.txt WA 6 ms 3440 KiB
testcase38.txt AC 1 ms 3492 KiB
testcase39.txt AC 6 ms 3440 KiB
testcase40.txt AC 1 ms 3632 KiB
testcase41.txt WA 6 ms 3652 KiB
testcase42.txt AC 1 ms 3556 KiB
testcase43.txt AC 6 ms 3552 KiB
testcase44.txt WA 1 ms 3564 KiB
testcase45.txt AC 5 ms 3408 KiB
testcase46.txt AC 1 ms 3696 KiB
testcase47.txt AC 6 ms 3544 KiB
testcase48.txt AC 1 ms 3628 KiB
testcase49.txt AC 5 ms 3568 KiB
testcase50.txt AC 1 ms 3696 KiB
testcase51.txt AC 6 ms 3564 KiB