Codeforces Round #140 (Div. 2)
2014-04-08 13:07
405 查看
A. Where do I Turn?
B.
Effective Approach
#include <iostream> using namespace std; struct point { long long x,y; }p[3]; long long chaji(point a,point b,point c) { return (c.x-a.x)*(b.y-a.y)-(b.x-a.x)*(c.y-a.y); } int main() { int i; for(i=0;i<3;i++) cin>>p[i].x>>p[i].y; if((p[2].y-p[1].y)*(p[1].x-p[0].x)==(p[1].y-p[0].y)*(p[2].x-p[1].x)) cout<<"TOWARDS"<<endl; else if(chaji(p[2],p[1],p[0])>0) cout<<"LEFT"<<endl; else cout<<"RIGHT"<<endl; return 0; }
B.
Effective Approach
#include <iostream> using namespace std; int main() { long long n,m,x,i,ans1,ans2; int data[100005],inp[100005]; cin>>n; for(i=1;i<=n;i++) { cin>>data[i];inp[data[i]]=i; } cin>>m; for(i=1;i<=m;i++) { cin>>x; ans1+=inp[x]; ans2+=(n-inp[x]+1); } cout<<ans1<<" "<<ans2<<endl; return 0; }
相关文章推荐
- Codeforces Round #140 (Div. 2) A. Where do I Turn?
- Codeforces Round #140 (Div. 1) D. The table 构造
- Codeforces Round #140 (Div. 2)——B
- Codeforces Round #140 (Div. 2) B. Effective Approach
- Codeforces Round #140 (Div. 2) 第五题:Anniversary
- Codeforces Round #140 (Div. 2)
- Codeforces Round #140 (Div. 1) Naughty Stone Piles 贪心
- Codeforces Round #140 (Div. 1)D The table 贪心
- Codeforces Round #140 (Div. 1) B Naughty Stone Piles
- 【CodeForce】Codeforces Round #140 (Div. 2) A B C
- Codeforces Round #140 (Div. 1)
- Codeforces Round #290 (Div. 2)-C. Fox And Names
- Codeforces Round #460 (Div. 2)-A. Supermarket
- Codeforces Round #335 (Div. 2) A. Magic Spheres 模拟
- Codeforces Round #395 (Div. 2)B. Timofey and cubes
- Codeforces Round #248 (Div. 2) C. Ryouko's Memory Note
- Codeforces Round #191 (Div. 2)---A. Flipping Game
- Codeforces Round #426 (Div. 2)-The Bakery(线段树+DP)
- Codeforces Round #426 (Div. 2) C - The Meaningless Game
- Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) ABCD题解