제출 #1094504

#제출 시각아이디문제언어결과실행 시간메모리
1094504modwwePort Facility (JOI17_port_facility)C++17
0 / 100
103 ms211792 KiB
#pragma GCC optimize("Ofast,unroll-loops") #include<bits/stdc++.h> //#define int long long //#define ll long long #define down cout<<'\n'; #define debug cout<<" cucuucucuuu",down #define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0); #define modwwe int t;cin>>t; while(t--) #define bit(i,j) (i>>j&1) #define sobit(a) __builtin_popcountll(a) #define task "test" #define fin(x) freopen(x".inp","r",stdin) #define fou(x) freopen(x".out","w",stdout) #define pb push_back #define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms"; using namespace std; #define getchar_unlocked getchar inline int scan() { char c = getchar_unlocked(); int x = 0; while (c < '0' || c > '9') { c = getchar_unlocked(); } while (c >= '0' && c <= '9') { x = (x << 1) + (x << 3) + c - '0'; c = getchar_unlocked(); } return x; } void phongbeo(); const int inf = 1e17; const int mod2 = 1e9 + 7; const int mod1 = 998244353; struct icd { long double a; int b; }; struct ib { int a; int b; }; struct ic { int a, b, c; }; struct id { int a, b, c, d; }; struct ie { int a, b, c, d, e; }; int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, l, r, mid, l2, r2, center; int i, s10, s12,k1,k2,s11; int kk; int el = 19; main() { if(fopen(task".inp","r")) { fin(task); fou(task); } NHP /// cin>>s1; ///modwwe phongbeo(); // checktime } vector<int> v[1000001]; ib a[1000001]; int c[1000001]; vector<int> v2[8000001]; bool cmp(ib a,ib b) { return a.a<b.a; } void dfs(int x) { for(auto f:v[x]) { if(c[f]==c[x]){cout<<0; exit(0);} if(!c[f]){ c[f]=3-c[x]; dfs(f); } } } void upd(int node,int l,int r,int l1,int r1,int x) { if(l>r1||r<l1) return; if(l>=l1&&r<=r1) { v2[node].pb(x); return; } int mid=l+r>>1; upd(node<<1,l,mid,l1,r1,x); upd(node<<1|1,mid+1,r,l1,r1,x); } void get(int node,int l,int r,int l1,int x) { s3=v2[node].size(); if(s3>=2){cout<<0; exit(0);} for(auto f:v2[node]) v[x].pb(f), v[f].pb(x); if(l==r) return; int mid=l+r>>1; if(l1<=mid)get(node<<1,l,mid,l1,x); else get(node<<1|1,mid+1,r,l1,x); } void phongbeo() { cin>>n; for(int i=1;i<=n;i++) cin>>a[i].a>>a[i].b; sort(a+1,a+1+n,cmp); for(int i=n;i>=1;--i) { get(1,1,n*2,a[i].b,i); upd(1,1,n*2,a[i].a,a[i].b,i); } s4=1; for(int i=1;i<=n;i++) if(!c[i]) { c[i]=1; s4=(s4<<1); if(s4>=mod2)s4-=mod2; dfs(i); } cout<<s4; }

컴파일 시 표준 에러 (stderr) 메시지

port_facility.cpp:36:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+17' to '2147483647' [-Woverflow]
   36 | const int inf = 1e17;
      |                 ^~~~
port_facility.cpp:67:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   67 | main()
      | ^~~~
port_facility.cpp: In function 'void upd(int, int, int, int, int, int)':
port_facility.cpp:107:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  107 |        int mid=l+r>>1;
      |                ~^~
port_facility.cpp: In function 'void get(int, int, int, int, int)':
port_facility.cpp:119:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  119 |      int mid=l+r>>1;
      |              ~^~
port_facility.cpp: In function 'int main()':
port_facility.cpp:12:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
port_facility.cpp:71:9: note: in expansion of macro 'fin'
   71 |         fin(task);
      |         ^~~
port_facility.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fou(x) freopen(x".out","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
port_facility.cpp:72:9: note: in expansion of macro 'fou'
   72 |         fou(task);
      |         ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...