oj.uz

Submission #782641

# Submission time Handle Problem Language Result Execution time Memory
782641 2023-07-14T06:44:29 Z Lyrically Sorting (IOI15_sorting) C++17
100 / 100
 142 ms 26700 KB 
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
int read(){int x;scanf("%d",&x);return x;}
void print(int x){printf("%d\n",x);}
void file(string s)
{
	freopen((s+".in").c_str(),"r",stdin);
	freopen((s+".out").c_str(),"w",stdout);
}
const int mod=998244353;
int tp[600005],tq[600005];
int sr[600005];
int fa[600005];
bool vis[600005];
int to[600005],iv[600005];
bool check(int ps,int n,int m,int s[],int x[],int y[])
{
	int tot=0;
	rep(i,n){sr[i]=s[i];}
	rep(i,ps)
	{
		swap(sr[x[i]],sr[y[i]]);
	}
	rep(i,n)
	{
		fa[sr[i]]=i;vis[i]=0;
	}
	rep(i,n)
	{
		if(!vis[i])
		{
			int now=i;
			while(!vis[now])
			{
				vis[now]=1;
				if(vis[fa[now]]){break;}
				tp[tot]=now,tq[tot]=fa[now];tot++;
				now=fa[now];
			}
		}
	}
	if(tot>=ps+1){return 0;}
	for(int i=tot;i<m;i++){tp[i]=tq[i]=0;}
	return 1;
}
int findSwapPairs(int n,int s[],int m,int x[],int y[],int p[],int q[])
{
	if(is_sorted(s,s+n)){return 0;}
	int l=1,r=m;
	while(l<=r)
	{
		int mid=(l+r)/2;
		if(check(mid,n,m,s,x,y)){r=mid-1;}
		else{l=mid+1;}
	}
	check(l,n,m,s,x,y);
	rep(i,n){to[i]=iv[i]=i;}
	for(int i=l-1;i>=0;i--)
	{
		p[i]=to[tp[i]];q[i]=to[tq[i]];
		swap(iv[x[i]],iv[y[i]]);
		swap(to[iv[x[i]]],to[iv[y[i]]]);
	}
	return l;
}

Compilation message

sorting.cpp: In function 'int read()':
sorting.cpp:7:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 | int read(){int x;scanf("%d",&x);return x;}
      |                  ~~~~~^~~~~~~~~
sorting.cpp: In function 'void file(std::string)':
sorting.cpp:11:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |  freopen((s+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sorting.cpp:12:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |  freopen((s+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 1 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 316 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 724 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 1 ms 596 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 580 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 576 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 528 KB Output is correct
14 Correct 1 ms 456 KB Output is correct

Subtask #6
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 580 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 576 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 528 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Correct 112 ms 23580 KB Output is correct
16 Correct 119 ms 24024 KB Output is correct
17 Correct 130 ms 25424 KB Output is correct
18 Correct 36 ms 13300 KB Output is correct
19 Correct 110 ms 23984 KB Output is correct
20 Correct 114 ms 24696 KB Output is correct
21 Correct 123 ms 24772 KB Output is correct
22 Correct 107 ms 20900 KB Output is correct
23 Correct 129 ms 26384 KB Output is correct
24 Correct 134 ms 25988 KB Output is correct
25 Correct 142 ms 25676 KB Output is correct
26 Correct 110 ms 24696 KB Output is correct
27 Correct 104 ms 23876 KB Output is correct
28 Correct 130 ms 25808 KB Output is correct
29 Correct 130 ms 25292 KB Output is correct
30 Correct 80 ms 23368 KB Output is correct
31 Correct 122 ms 25764 KB Output is correct
32 Correct 120 ms 25400 KB Output is correct
33 Correct 126 ms 25920 KB Output is correct
34 Correct 124 ms 25804 KB Output is correct
35 Correct 107 ms 23608 KB Output is correct
36 Correct 46 ms 22296 KB Output is correct
37 Correct 134 ms 26700 KB Output is correct
38 Correct 135 ms 25696 KB Output is correct
39 Correct 125 ms 25804 KB Output is correct