oj.uz

Submission #1080007

# Submission time Handle Problem Language Result Execution time Memory
1080007 2024-08-29T06:03:14 Z Trumling Sorting (IOI15_sorting) C++14
20 / 100
 21 ms 27220 KB 
    #include "sorting.h"
    #include<bits/stdc++.h>
    using namespace std;
     
    #define F first
    #define S second
    #define pb push_back
    #define all(x) x.begin(),x.end()
    #define INF 9999999999999999
    typedef long long ll;
     
    int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
     
    	ll pos[N];
        for(int i=0;i<N;i++)
		{
			pos[S[i]]=i;
		}
    		
		
    	// for(int i=0;i<N;i++)
		// 	cout<<pos[i]<<' ';

		// 	cout<<'\n';
		vector<pair<ll,ll>>v;
		ll n=N;
    	for(int i=0;i<n;i++)
			for(int j=0;j<n-1;j++)
					if(S[j]>S[j+1])
					{
						v.pb({j,j+1});
						swap(S[j],S[j+1]);
					}
							
					
			
		for(int i=0;i<v.size();i++)
			{
				P[i]=v[i].F;
				Q[i]=v[i].S;
			}
		// for(int i=0;i<N;i++)
		//  	cout<<S[i]<<' ';

     
    	return v.size();
    }

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:37:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |   for(int i=0;i<v.size();i++)
      |               ~^~~~~~~~~
sorting.cpp:5:15: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
    5 |     #define F first
sorting.cpp:39:15: note: in expansion of macro 'F'
   39 |     P[i]=v[i].F;
      |               ^
sorting.cpp:6:15: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
    6 |     #define S second
sorting.cpp:40:15: note: in expansion of macro 'S'
   40 |     Q[i]=v[i].S;
      |               ^
sorting.cpp:46:19: warning: conversion from 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   46 |      return v.size();
      |             ~~~~~~^~
sorting.cpp:14:9: warning: variable 'pos' set but not used [-Wunused-but-set-variable]
   14 |      ll pos[N];
      |         ^~~
sorting.cpp:12:43: warning: unused parameter 'M' [-Wunused-parameter]
   12 |     int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                       ~~~~^
sorting.cpp:12:50: warning: unused parameter 'X' [-Wunused-parameter]
   12 |     int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                              ~~~~^~~
sorting.cpp:12:59: warning: unused parameter 'Y' [-Wunused-parameter]
   12 |     int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                                       ~~~~^~~

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 448 KB Output is correct
12 Correct 1 ms 604 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 448 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 21 ms 27220 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Runtime error 21 ms 27220 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -