結果

問題 No.2509 Beam Shateki
ユーザー GOTKAKO
提出日時 2023-10-20 23:35:14
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 29 ms / 2,000 ms
コード長 3,051 bytes
コンパイル時間 1,847 ms
コンパイル使用メモリ 188,808 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-20 23:36:25
合計ジャッジ時間 4,133 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 61
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:75:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
   75 |         auto [x1,y1,x2,y2,a1,b1,p1] = beam.at(i);
      |              ^
main.cpp:77:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
   77 |             auto [x3,y3,x4,y4,a2,b2,p2] = beam.at(k);
      |                  ^
main.cpp:87:21: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
   87 |                 auto[cx,cy] = crossP(p{x1+0.0,y1+0.0},p{x2+0.0,y2+0.0},p{x3+0.0,y3+0.0},p{x4+0.0,y4+0.0});
      |                     ^

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
struct p{ double x,y; };
p psub(p a,p b){ return {a.x-b.x,a.y-b.y};}
double dst(p a, p b, p c, p d){
a = psub(a,b); c = psub(c,d);
double ret = a.x*c.y - a.y*c.x;
return ret;
}
pair<int,int> crossP(p a, p b, p c, p d){
double D = dst(b,a,d,c), s = dst(c,a,d,c), t = dst(b,a,a,c);
s /= D; t /= D;
if(D == 0.0) return {-1e9,-1e9};
if(s < 0.0 || 1.0 < s || t < 0.0 || 1.0 < t){return {-1e9,-1e9};}
return {a.x + s*(b.x-a.x), a.y + s*(b.y-a.y)};
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int H,W; cin >> H >> W;
if(W == 1) swap(H,W);
vector<vector<int>> A(H,vector<int>(W));
for(auto &h : A) for(auto &w : h) cin >> w;
if(H == 1){
int sum = 0;
for(auto h : A) for(auto w : h) sum += w;
cout << sum << endl; return 0;
}
vector<tuple<int,int,int,int,int,int,int>> beam;
for(int i=0; i<H; i++){
for(int k=0; k<W; k++){
if(!(i == 0 || i == H-1 || k == 0 || k == W-1)) continue;
bool one = true;
for(int a=-1; a<=1; a++) for(int b=0; b<=1; b++){
if(a == 0 && b == 0) continue;
if(a == -1 && b != 1) continue;
if(i == 0 && a == -1) continue;
if(i != 0 && abs(a) == 1 && b == 0) continue;
if(i == H-1 && a == 1) continue;
if(k == W-1 && b == 1) continue;
if(k == W-1 && i != 0) continue;
if(a == 0 && b == 1 && k != 0) continue;
if(a == 1 && b == 0 && i != 0) continue;
int x = i, y = k, p = 0,grid = 0, i2 = 0,k2 = 0;
while(true){
p += A.at(x).at(y); grid++;
x += a; y += b;
if(x < 0 || x >= H || y < 0 || y >= W){
i2 = x-a; k2 = y-b;
break;
}
}
if(!one && grid == 1) continue;
if(one && grid == 1) one = false;
beam.push_back({i,k,i2,k2,a,b,p});
}
}
}
int bs = beam.size(),answer = 0;
for(int i=0; i<bs; i++){
auto [x1,y1,x2,y2,a1,b1,p1] = beam.at(i);
for(int k=i+1; k<bs; k++){
auto [x3,y3,x4,y4,a2,b2,p2] = beam.at(k);
int now = p1+p2; bool check = true;
if(a1 == a2 && b1 == b2) check = false;
set<pair<int,int>> ab,comp;
ab.insert({a1,b1}); ab.insert({a2,b2});
comp.insert({-1,1}); comp.insert({1,1});
if(ab == comp && (x1+y1)%2 != (x3+y3)%2) check = false;
if(check){
auto[cx,cy] = crossP(p{x1+0.0,y1+0.0},p{x2+0.0,y2+0.0},p{x3+0.0,y3+0.0},p{x4+0.0,y4+0.0});
if(cx >= 0 && cx < H && cy >= 0 && cy < W) now -= A.at(cx).at(cy);
}
answer = max(answer,now);
}
}
cout << answer << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0