[解題報告][ZeroJudge][d550] 物件排序

程式碼, ZeroJudge 本文总阅读量次

下有捏請注意

原始版

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
/*
Problem: d550
Language: C++
Result: AC (375ms, 5327KB) on ZeroJudge
Author: m80126colin at 2010-07-09 13:40:13
Solution: Straight Forward
*/
#include <iostream>
#include <algorithm>
using namespace std;
int n,m,s[10000][200],h[10000];
bool cmp(int x,int y) {
	int i;
	for (i=0;i<m;i++) {
		if (s[x][i]!=s[y][i]) return s[x][i]<s[y][i];
	}
	return 1;
}
int main() {
	int i,j;
	while (~scanf("%d%d",&n,&m)) {
		for (i=0;i<n;i++) {
			h[i]=i;
			for (j=0;j<m;j++) scanf("%d",&s[i][j]);
		}
		sort(h,h+n,cmp);
		for (i=0;i<n;i++) {
			for (j=0;j<m;j++) printf("%d ",s[h[i]][j]);
			printf("\n");
		}
	}
}

短碼版

1
2
3
4
5
6
7
8
9
10
11
12
/*
Problem: d550 (short version)
Language: C++
Result: AC (395ms, 5355KB) on ZeroJudge
Author: m80126colin at 2010-07-09 14:39:35
Solution: Straight Forward
*/
#include <iostream>
int n,m,s[10001][201],h[10001],i,j,z;
bool cmp(int x,int y){for (z=m;z&&s[x][z]==s[y][z];z--) ;return s[x][z]>s[y][z];}
int a(){for (i=n,j=--m;i;j?j--:(j=m,h[i]=i--))scanf("%d",&s[i][j]);for (std::sort(h+1,h+n+1,cmp),i=n,j=m;i;j?j--:(i--,j=m,putchar(10)))printf("%d ",s[h[i]][j]);return 1;}
int main(){~scanf("%d%d",&n,&m)&&a()&& main();}
程式碼, ZeroJudge