oj.uz

Submission #228879

# Submission time Handle Problem Language Result Execution time Memory
228879 2020-05-03T01:52:35 Z blacktulip Subway (info1cup19_subway) C++17
17.268 / 100
 1000 ms 108264 KB 
#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(int 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;

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

int main(void){
	scanf("%d",&n);
	printf("%d\n",n+1);
	printf("0 -1\n");
	FOR{
		printf("%d 0\n",i);
	}
	return 0;
}

Compilation message

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

Subtask #1
13.7254901961 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Partially correct 5 ms 512 KB Partially correct
4 Partially correct 5 ms 384 KB Partially correct
5 Partially correct 4 ms 384 KB Partially correct

Subtask #2
3.5425101215 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Partially correct 5 ms 512 KB Partially correct
4 Partially correct 5 ms 384 KB Partially correct
5 Partially correct 4 ms 384 KB Partially correct
6 Partially correct 5 ms 384 KB Partially correct
7 Partially correct 5 ms 384 KB Partially correct
8 Partially correct 5 ms 256 KB Partially correct
9 Partially correct 5 ms 384 KB Partially correct
10 Partially correct 5 ms 384 KB Partially correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Partially correct 5 ms 512 KB Partially correct
4 Partially correct 5 ms 384 KB Partially correct
5 Partially correct 4 ms 384 KB Partially correct
6 Partially correct 5 ms 384 KB Partially correct
7 Partially correct 5 ms 384 KB Partially correct
8 Partially correct 5 ms 256 KB Partially correct
9 Partially correct 5 ms 384 KB Partially correct
10 Partially correct 5 ms 384 KB Partially correct
11 Execution timed out 1076 ms 108264 KB Time limit exceeded
12 Halted 0 ms 0 KB -