oj.uz

Submission #167293

# Submission time Handle Problem Language Result Execution time Memory
167293 2019-12-07T08:27:56 Z AKaan37 Izlet (COI19_izlet) C++17
0 / 100
 884 ms 71040 KB 
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

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

#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(lo i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((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 = 500005;
const lo mod = 1000000007;

lo n,m,b[li],a[3005][3005],k,flag,t,score;
lo cev;
string s;
vector<lo> v;

int main(void){
	scanf("%lld",&score);
	scanf("%lld",&n);
	FOR{
		for(lo j=1;j<=n;j++)scanf("%lld",&a[i][j]);
	}
	b[1]=1;
	lo last=1;
	for(lo i=2;i<=n;i++){
		if(a[i][i-1]==last)b[i]=b[i-1];
		else b[i]=b[i-1]+1;
		last=a[i][i-1];
	}
	FOR printf("%lld ",b[i]);
	printf("\n");
	for(lo i=1;i<n;i++){
		printf("%lld %lld\n",i,i+1);
	}
	return 0;
}

Compilation message

izlet.cpp: In function 'int main()':
izlet.cpp:42:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&score);
  ~~~~~^~~~~~~~~~~~~~~
izlet.cpp:43:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&n);
  ~~~~~^~~~~~~~~~~
izlet.cpp:45:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   for(lo j=1;j<=n;j++)scanf("%lld",&a[i][j]);
                       ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 18.0

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

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 884 ms 71040 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 57.0

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