oj.uz

Submission #96133

# Submission time Handle Problem Language Result Execution time Memory
96133 2019-02-06T11:40:01 Z AKaan37 medians (balkan11_medians) C++17
0 / 100
 28 ms 3036 KB 
#include <bits/stdc++.h>

using namespace std;

typedef pair< int,int > PII;
typedef long long int lo;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid (bas+son)/2

const lo MAX = -1000000000000000000; 
const lo MIN = 1000000000000000000; 
const lo inf = 1000000000; 
const lo KOK = 100000; 
const lo LOG = 30; 
const lo li = 1000005; 
const lo mod = 1000000007; 

lo n,m,cev,b,a[li];
string s;
vector<int> v;

int main(){
	//~ freopen("","r",stdin);
	//~ freopen("","w",stdout);
	scanf("%lld",&n);
	FOR{
		scanf("%lld",&a[i]);
	}
	for(lo i=1;i<=n*2-1;i++) printf("%lld ",i);
	return 0;
}

Compilation message

medians.cpp: In function 'int main()':
medians.cpp:31:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&n);
  ~~~~~^~~~~~~~~~~
medians.cpp:33:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&a[i]);
   ~~~~~^~~~~~~~~~~~~~

Subtask #1
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Incorrect 2 ms 376 KB Output isn't correct
4 Incorrect 2 ms 256 KB Output isn't correct
5 Incorrect 2 ms 256 KB Output isn't correct
6 Incorrect 2 ms 376 KB Output isn't correct
7 Incorrect 2 ms 376 KB Output isn't correct
8 Incorrect 2 ms 256 KB Output isn't correct
9 Incorrect 2 ms 376 KB Output isn't correct
10 Incorrect 2 ms 376 KB Output isn't correct
11 Incorrect 2 ms 376 KB Output isn't correct
12 Incorrect 2 ms 376 KB Output isn't correct
13 Incorrect 2 ms 376 KB Output isn't correct

Subtask #2
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Incorrect 3 ms 380 KB Output isn't correct
3 Incorrect 4 ms 504 KB Output isn't correct
4 Incorrect 6 ms 760 KB Output isn't correct
5 Incorrect 20 ms 1144 KB Output isn't correct
6 Incorrect 19 ms 1912 KB Output isn't correct
7 Incorrect 28 ms 3036 KB Output isn't correct