제출 #587562

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
587562		h_squared	로봇 (IOI13_robots)	C++14	0 / 100	1 ms	276 KiB

robots

#include "robots.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef double dd;
typedef long double ldd;
#define tst int tttt;cin>>tttt;for(int TTTT=1;TTTT<=tttt;TTTT++)
#define nl cout<<"\n";
#define forn(a,b) for (int ii=a;ii<b;ii++)
const ll MOD1=1e9+7;
const ll MOD2=998244353;
#define pii pair<int,int>
#define mp(a,b) make_pair(a,b)
#define pb push_back
#define all(a) a.begin(),a.end()
#define vi vector<int>
#define vll vector<ll>
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define hhh cout<<"here"<<endl;
#define pi 3.14159265

ll mod=MOD1;
ll po(ll x,ll y,ll mod=mod) {if(y<0)return 0;y%=(mod-1);ll res=1;while(y>0){if(y&1)res=(res*x)%mod;x=(x*x)%mod;y>>=1;}return (res%mod);}
ll gcd(ll a, ll b){if(a<b) swap(a,b);if(b==0) return a;return gcd(a%b,b);}

int putaway(int a, int b, int t, int x[], int y[], int w[], int s[]) {
    if(x[0]>w[0] && y[1]>s[1])return 1;
    if(x[0]>w[1] && y[1]>s[0])return 1;
    int ww=max(w[0],w[1]);
    int ss=max(s[0],s[1]);
    if(max(x[0],x[1])<=ww && max(y[0],y[1])<=ss)return -1;
    return 2;
}
// int main(){
//     // fastio
//     // ++*(int*)0;// crash
//     // freopen("in.txt","r",stdin);freopen("outt.txt","w",stdout);
//     tst
//     {
//         solve();nl;
//     }
// }

/*

*/

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 25
• Subtask 4: 0 / 37
• Subtask 5: 0 / 10