pyc_sxyz 2013-11-02 17:36:50
点我顶贴
收藏
删除
我的复杂度是O(N^2+K)的,怎么会超时
附代码:
//pyc-49a
var
n,k,i,j,x,y:longint;
ch:char;
a:array[1..1000,1..1000] of longint;
r,c:array[1..1000] of longint;
procedure swap(var a,b:longint);
var
t:longint;
begin
t:=a;
a:=b;
b:=t;
end;
begin
readln(n,k);
for i:=1 to n do
for j:=1 to n do
read(a[i,j]);
readln;
for i:=1 to n do
r[i]:=i;
for i:=1 to n do
c[i]:=i;
for i:=1 to k do
begin
readln(ch,x,y);
case ch of
'R':
swap(r[x],r[y]);
'C':
swap(c[x],c[y]);
'A':
writeln(a[r[x],c[y]]);
end;
end;
end.