QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#64017 | #2485. Astrology | As3b_team_f_masr# | WA | 2ms | 3280kb | C++ | 2.0kb | 2022-11-23 21:46:54 | 2022-11-23 21:46:54 |
Judging History
answer
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define EPS 1e-9
#define PI acos(-1.0)
#define ll long long
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
#define pb push_back
#define ft first
#define sc second
#define pi pair<ll,ll>
#define vi vector<ll>
#define sz(s) s.size()
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const ll N = 1e5+5, M = 300*300 + 5, MOD = 1e4+5, INF = 1e18;
int dx[] = {-1, 1, 0, 0}, Dx[] = {-1, -1, 0, 1, 1, 1, 0, -1};;
int dy[] = {0, 0, 1, -1}, Dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
int n, m, tt;
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);//freopen("lines.in", "r", stdin);
map<pair<int,pi>,string> mp;
mp[{3,{21,31}}] = "Aries";
mp[{4,{1,19}}] = "Aries";
mp[{4,{20,31}}] = "Taurus";
mp[{5,{1,20}}] = "Taurus";
mp[{5,{21,31}}] = "Gemini";
mp[{6,{1,20}}] = "Gemini";
mp[{6,{21,31}}] = "Cancer";
mp[{7,{1,22}}] = "Cancer";
mp[{7,{23,31}}] = "Leo";
mp[{8,{1,22}}] = "Leo";
mp[{8,{23,31}}] = "Virgo";
mp[{9,{1,22}}] = "Virgo";
mp[{9,{23,31}}] = "Libra";
mp[{10,{1,22}}] = "Libra";
mp[{10,{23,31}}] = "Scorpio";
mp[{11,{1,22}}] = "Scorpio";
mp[{11,{23,31}}] = "Sagittarius";
mp[{12,{1,21}}] = "Sagittarius";
mp[{12,{22,31}}] = "Capricorn";
mp[{1,{1,19}}] = "Capricorn";
mp[{1,{20,31}}] = "Aquarius";
mp[{2,{1,18}}] = "Aquarius";
mp[{2,{19,31}}] = "Pisces";
mp[{3,{1,20}}] = "Pisces";
string s;
cin >> s;
int mn = (s[5]-'0')*10 + (s[6]-'0');
int day = (s[8]-'0')*10 + (s[9]-'0');
for(auto it:mp){
if(it.ft.ft == mn && mn >= it.ft.sc.ft && mn <= it.ft.sc.sc) cout << it.sc;
}
return 0;
}
/*
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3280kb
input:
2021-05-07
output:
Taurus
result:
ok single line: 'Taurus'
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3224kb
input:
2050-10-28
output:
Libra
result:
wrong answer 1st lines differ - expected: 'Scorpio', found: 'Libra'