oj.uz

Submission #42573

# Submission time Handle Problem Language Result Execution time Memory
42573 2018-02-28T09:10:07 Z nonocut Adriatic (CEOI13_adriatic) C++14
0 / 100
 2000 ms 262144 KB 
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define X first
#define Y second
const int maxv = 2500;
const int maxn = 250000 + 5;
struct node {
	int x,y,id;
};
int n;
node p[maxn];
int pos[maxv+5];
vector<int> way[maxn];
bool cmp(node a, node b) {
	if(a.x!=b.x) return a.x<b.x;
	return a.y>b.y;
}
int main() {
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%d%d",&p[i].x,&p[i].y), p[i].id = i;
	sort(&p[1],&p[n+1],cmp);
	for(int i=1;i<=n;i++) {
        int cur = 0;
        for(int y=p[i].y-1;y>=1;y--) {
            if(pos[y]>cur) {
                cur = pos[y];
                way[p[i].id].push_back(p[pos[y]].id);
            }
        }
        pos[p[i].y] = i;
	}
}

Compilation message

adriatic.cpp: In function 'int main()':
adriatic.cpp:20:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
adriatic.cpp:21:66: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) scanf("%d%d",&p[i].x,&p[i].y), p[i].id = i;
                                                                  ^

Subtask #1
0 / 25.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2041 ms 262144 KB Time limit exceeded
2 Halted 0 ms 0 KB -