QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#39841	#4356. Giraffes	ZeinDaner^#	0	5ms	3704kb	C++	965b	2022-07-14 05:19:17	2024-05-26 01:01:22

Judging History

你现在查看的是最新测评结果

[2024-05-26 01:01:22]
评测

测评结果：0
用时：5ms
内存：3704kb

查看

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2022-07-14 05:19:17]
提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> x,bc;
int n; 
int mincost(int id){
  if(id+3>=n){
    int c=0;
    for(int i=0;i<n;i++){
      c+=(x[i]!=bc[i]);
    }
    return c;
  }
  int mi=x[id],ma=x[id];
  int ii=id,ia=id;
  bool ok=1;
  int ans=1e9;
  for(int j=id;j<n;j++){
    if(mi>x[j]){
      ii=j; mi=x[j];
    }
    if(ma<x[j]){
      ia=j; ma=x[j];
    }
    if((x[id]!=mi && x[id]!=ma) && (x[j]!=mi && x[j]!=ma)){
      swap(x[ii],x[id]);
      ans=min(ans,mincost(id+1));
      swap(x[ii],x[id]);
      
      swap(x[ia],x[id]);
      ans=min(ans,mincost(id+1));
      swap(x[ia],x[id]);
      ok=0;
    }
  }
  if(ok) ans=mincost(id+1);
  return ans;
 
}
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin>>n;
  for(int i=0;i<n;i++){
    int a; cin>>a;
    x.push_back(a);
    bc.push_back(a);
  }
  cout<<mincost(0)<<endl;
}

Source code, Language: C++

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0

Wrong Answer

Test #1:

score: 10

Accepted

time: 0ms

memory: 3640kb

input:

1
1

output:

result:

ok single line: '0'

Test #2:

score: 0

Accepted

time: 0ms

memory: 3608kb

input:

2
2 1

output:

result:

ok single line: '0'

Test #3:

score: 0

Accepted

time: 0ms

memory: 3680kb

input:

3
1 2 3

output:

result:

ok single line: '0'

Test #4:

score: 0

Accepted

time: 0ms

memory: 3704kb

input:

4
3 1 4 2

output:

result:

ok single line: '2'

Test #5:

score: 0

Accepted

time: 0ms

memory: 3704kb

input:

5
3 4 5 1 2

output:

result:

ok single line: '2'

Test #6:

score: 0

Accepted

time: 0ms

memory: 3704kb

input:

6
1 5 6 2 4 3

output:

result:

ok single line: '2'

Test #7:

score: 0

Accepted

time: 0ms

memory: 3640kb

input:

6
1 6 3 4 2 5

output:

result:

ok single line: '0'

Test #8:

score: 0

Accepted

time: 0ms

memory: 3568kb

input:

7
5 3 4 6 2 7 1

output:

result:

ok single line: '0'

Test #9:

score: -10

Wrong Answer

time: 0ms

memory: 3628kb

input:

7
5 3 7 1 2 6 4

output:

result:

wrong answer 1st lines differ - expected: '3', found: '4'

Subtask #2:

score: 0

Wrong Answer

Test #11:

score: 22

Accepted

time: 0ms

memory: 3608kb

input:

8
7 2 1 8 3 5 4 6

output:

result:

ok single line: '3'

Test #12:

score: 0

Accepted

time: 0ms

memory: 3624kb

input:

9
3 1 5 6 8 4 7 9 2

output:

result:

ok single line: '3'

Test #13:

score: 0

Accepted

time: 0ms

memory: 3612kb

input:

10
4 6 5 7 1 2 3 8 9 10

output:

result:

ok single line: '2'

Test #14:

score: 0

Accepted

time: 0ms

memory: 3684kb

input:

11
2 10 3 11 1 5 8 6 4 7 9

output:

result:

ok single line: '5'

Test #15:

score: -22

Wrong Answer

time: 5ms

memory: 3636kb

input:

12
2 7 3 1 9 4 8 12 11 6 5 10

output:

result:

wrong answer 1st lines differ - expected: '5', found: '6'

Subtask #3:

score: 0

Time Limit Exceeded

Test #21:

score: 0

Time Limit Exceeded

input:

29
7 22 11 16 27 1 24 12 6 21 13 2 10 8 25 15 4 19 17 9 23 5 14 20 18 28 26 29 3

output:

result:

Subtask #4:

score: 0

Time Limit Exceeded

Test #31:

score: 0

Time Limit Exceeded

input:

2317
1841 533 998 38 1358 1204 1174 176 581 1719 550 906 35 101 442 1068 1781 601 1368 2190 2095 919 2186 1134 1814 625 90 2007 653 186 204 997 1607 1675 45 806 483 299 27 935 1070 1425 1822 1712 2074 2259 264 840 1960 1045 1742 1185 577 142 980 151 2136 2143 955 462 1373 395 1300 185 637 734 803 13...